Free Access
RAIRO-Oper. Res.
Volume 55, 2021
Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
Page(s) S1747 - S1765
Published online 02 March 2021
  • P. Baptiste, F. Della Croce, A. Grosso and V. T’Kindt, Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J. Scheduling 13 (2010) 39–47. [Google Scholar]
  • E. Beale and R. Small, Mixed integer programming by a branch-and-bound technique. Proc. Third IFIP Cong. 2 (1965) 450–451. [Google Scholar]
  • L. Berghman and F.C.R. Spieksma, Valid inequalities for a time-indexed formulation. Oper. Res. Lett. 43 (2015) 268–272. [Google Scholar]
  • L. Bigras, M. Gamache and G. Savard, Time-indexed formulations and the total weighted tardiness problem. INFORMS J. Comput. 20 (2008) 133–142. [Google Scholar]
  • Y. Crama and F.C.R. Spieksma, Scheduling jobs of equal length: complexity, facets and computational results. Math. Prog. 72 (1996) 207–227. [Google Scholar]
  • Y. Crama, A.W.J. Kolen, A.G. Oerlemans and F.C.R. Spieksma, Throughput rate optimization in the automated assembly of printed circuit boards. Ann. Oper. Res. 26 (1990) 455–480. [Google Scholar]
  • N.J. Driebeek, An algorithm for the solution of mixed integer programming problems. Manage. Sci. 12 (1966) 576–587. [Google Scholar]
  • M.E. Dyer and L.A. Wolsey, Formulating the single machine sequencing problem with release dates as a mixed integer problem. Disc. Appl. Math. 26 (1990) 255–270. [Google Scholar]
  • M. Gairing, B. Monien and A. Woclaw, A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. 380 (2007) 87–99. [Google Scholar]
  • P. Hansen, C. Oğuz and N. Mladenović, Variable neighborhood search for minimum cost berth allocation. Eur. J. Oper. Res. 191 (2008) 636–649. [Google Scholar]
  • J.K. Lenstra, D.B. Shmoys and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines. Math. Prog. 46 (1990) 259–271. [Google Scholar]
  • F. Sourd, New exact algorithms for one-machine earliness-tardiness scheduling. INFORMS J. Comput. 21 (2009) 167–175. [Google Scholar]
  • J.P. Sousa and L.A. Wolsey, A time indexed formulation of non-preemptive single machine scheduling problems. Math. Prog. 54 (1992) 353–367. [Google Scholar]
  • S. Tanaka, S. Fujikuma and M. Araki, An exact algorithm for single-machine scheduling without machine idle time. J. Scheduling 12 (2009) 575–593. [Google Scholar]
  • V. T’kindt, F. Della Croce and J.L. Bouquard, Enumeration of Pareto optima for a flowshop scheduling problem with two criteria. INFORMS J. Comput. 19 (2007) 64–72. [Google Scholar]
  • Y. Unlu and S.J. Mason, Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems. Comput. Ind. Eng. 58 (2010) 785–800. [Google Scholar]
  • J.M. van den Akker, J.A. Hoogeveen and S.L. van de Velde, Parallel machine scheduling by column generation. Oper. Res. 47 (1999) 862–872. [Google Scholar]
  • J.M. van den Akker, C.P.M. Van Hoesel and M.W.P. Savelsbergh, A polyhedral approach to single-machine scheduling problems. Math. Prog. 85 (1999) 541–572. [Google Scholar]
  • J.M. van den Akker, C.A.J. Hurkens and M.W.P. Savelsbergh, Time-indexed formulations for machine scheduling problems: column generation. INFORMS J. Comput. 12 (2000) 111–124. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.