Erratum to ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009) 81-87]

Article English OPEN
Rapine , Christophe;
(2013)
  • Publisher: Elsevier
  • Related identifiers: doi: 10.1016/j.ijpe.2012.11.010
  • Subject: makespan | flowshop | scheduling | unavailability period | [ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]

International audience; In Allaoui H., Artiba A, ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009)] the authors propose optimality condit... View more
  • References (5)

    Allaoui, H., & Artiba, A. (2009). Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods. International Journal of Production Economics, 121, 81 - 87.

    Bertsekas, D. P., & Tsitsiklis, J. N. (2008). Introduction to Probability. (2nd ed.). Athena Scientific.

    Garey, M., & Johnson, D. (1979). Computers and Intractability : A Guide to the Theory of NP-completness.. W.H. Freeman & Co.

    Graham, R. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17.

    Rapine, C. (submitted). Erratum to ”scheduling of a two-machine flowshop with availability constraints on the first machine”. International Journal of Production Economics, 99, 16 - 27.

  • Metrics
Share - Bookmark