Advertisement

Journal of Scheduling

, Volume 21, Issue 2, pp 227–233 | Cite as

Exact exponential algorithms for 3-machine flowshop scheduling problems

  • Lei Shang
  • Christophe Lenté
  • Mathieu Liedloff
  • Vincent T’Kindt
Article

Abstract

In this paper, we focus on the design of an exact exponential time algorithm with a proved worst-case running time for 3-machine flowshop scheduling problems considering worst-case scenarios. For the minimization of the makespan criterion, a Dynamic Programming algorithm running in \({\mathcal {O}}^*(3^n)\) is proposed, which improves the current best-known time complexity \(2^{{\mathcal {O}}(n)}\times \Vert I\Vert ^{{\mathcal {O}}(1)}\) in the literature. The idea is based on a dominance condition and the consideration of the Pareto Front in the criteria space. The algorithm can be easily generalized to other problems that have similar structures. The generalization on two problems, namely the \(F3\Vert f_\mathrm{max}\) and \(F3\Vert \sum f_i\) problems, is discussed.

Keywords

Moderately exponential algorithms Dynamic programming Flowshop 

References

  1. Akiba, T., & Iwata, Y. (2015). Branch-and-reduce exponential/fpt algorithms in practice: A case study of vertex cover. Theoretical Computer Science. doi: 10.1016/j.tcs.2015.09.023. http://www.sciencedirect.com/science/article/pii/S030439751500852X.
  2. Ashour, S. (1970). A branch-and-bound algorithm for the flow shop problem scheduling problem. AIIE Transactions, 2, 172–176.CrossRefGoogle Scholar
  3. Brown, A., & Lomnicki, Z. (1966). Some applications of the “branch-and-bound” algorithm to the machine scheduling problem. Journal of the Operational Research Society, 17(2), 173–186.CrossRefGoogle Scholar
  4. Brucker, P. (2007). Scheduling algorithms (5th ed.). Berlin: Springer.Google Scholar
  5. Carlier, J., & Rebaï, I. (1996). Two branch and bound algorithms for the permutation flow shop problem. European Journal of Operational Research, 90(2), 238–251.CrossRefGoogle Scholar
  6. Cheng, J., Kise, H., & Matsumoto, H. (1997). A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem. European Journal of Operational Research, 96(3), 578–590.CrossRefGoogle Scholar
  7. Cygan, M., Pilipczuk, M., Pilipczuk, M., & Wojtaszczyk, J. O. (2014). Scheduling partially ordered jobs faster than \(2^n\). Algorithmica, 68(3), 692–714.CrossRefGoogle Scholar
  8. Fomin, F. V., & Kratsch, D. (2010). Exact exponential algorithms. Springer Berlin Heidelberg.Google Scholar
  9. Framinan, J. M., Gupta, J. N., & Leisten, R. (2004). A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society, 55(12), 1243–1255.CrossRefGoogle Scholar
  10. Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129.CrossRefGoogle Scholar
  11. Gromicho, J. A., van Hoorn, J. J., da Gama, F. S., & Timmer, G. T. (2012). Solving the job-shop scheduling problem optimally by dynamic programming. Computers & Operations Research, 39(12), 2968–2977.Google Scholar
  12. Ignall, E., & Schrage, L. (1965). Application of the branch and bound technique to some flow-shop scheduling problems. Operations Research, 13(3), 400–412.CrossRefGoogle Scholar
  13. Jansen, K., Land, F., & Land, K. (2013). Bounding the running time of algorithms for scheduling and packing problems. In F. Dehne, R. Solis-Oba, & J. R. Sack (Eds.), Algorithms and data structures (Vol. 8037, pp. 439–450)., Lecture notes in computer science Berlin: Springer.CrossRefGoogle Scholar
  14. Johnson, S. M. (1954). Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61–68.CrossRefGoogle Scholar
  15. Kelley Jr, J. E., & Walker, M. R. (1959). Critical-path planning and scheduling. In Papers Presented at the December 1–3, 1959, Eastern Joint IRE-AIEE-ACM Computer Conference (pp. 160–173), ACM.Google Scholar
  16. Kung, H. T., Luccio, F., & Preparata, F. P. (1975). On finding the maxima of a set of vectors. Journal of the ACM (JACM), 22(4), 469–476.CrossRefGoogle Scholar
  17. Ladhari, T., & Haouari, M. (2005). A computational study of the permutation flow shop problem based on a tight lower bound. Computers & Operations Research, 32(7), 1831–1847.CrossRefGoogle Scholar
  18. Lageweg, B., Lenstra, J., & Rinnooy Kan, A. (1978). A general bounding scheme for the permutation flow-shop problem. Operations Research, 26(1), 53–67.CrossRefGoogle Scholar
  19. Lenté, C., Liedloff, M., Soukhal, A., & T’Kindt, V. (2013). On an extension of the Sort & Search method with application to scheduling theory. Theoretical Computer Science, 511, 13–22.CrossRefGoogle Scholar
  20. Lenté, C., Liedloff, M., Soukhal, A., & T’Kindt, V. (2014). Exponential algorithms for scheduling problems. https://hal.archives-ouvertes.fr/hal-00944382.
  21. Lomnicki, Z. (1965). A “branch-and-bound” algorithm for the exact solution of the three-machine scheduling problem. Journal of the Operational Research Society, 16(1), 89–100.CrossRefGoogle Scholar
  22. McMahon, G., & Burton, P. (1967). Flow-shop scheduling with the branch-and-bound method. Operations Research, 15(3), 473–481.CrossRefGoogle Scholar
  23. Potts, C. (1980). An adaptive branching rule for the permutation flow-shop problem. European Journal of Operational Research, 5(1), 19–25.CrossRefGoogle Scholar
  24. Reza Hejazi, S., & Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: A review. International Journal of Production Research, 43(14), 2895–2929.CrossRefGoogle Scholar
  25. Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2), 479–494. Project Management and Scheduling.CrossRefGoogle Scholar
  26. Smutnicki, C. (1998). Some results of the worst-case analysis for flow shop scheduling. European Journal of Operational Research, 109(1), 66–87.CrossRefGoogle Scholar
  27. Sviridenko, M. (2004). A note on permutation flow shop problem. Annals of Operations Research, 129(1), 247–252.CrossRefGoogle Scholar
  28. Woeginger, G. J. (2003). Exact algorithms for NP-hard problems: A survey. In M. Jünger, G. Reinelt, & G. Rinaldi (Eds.), Combinatorial optimization—Eureka, you shrink! (Vol. 2570, pp. 185–207)., Lecture notes in computer science Berlin: Springer.CrossRefGoogle Scholar
  29. Xiao, M., & Nagamochi, H. (2013). Exact algorithms for maximum independent set. In L. Cai, S. W. Cheng, & T. W. Lam (Eds.), Algorithms and computation (Vol. 8283, pp. 328–338)., Lecture notes in computer science Berlin: Springer.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Laboratoire d’Informatique (EA 6300), ERL CNRS OC 6305Université François-Rabelais de ToursToursFrance
  2. 2.INSA Centre Val de Loire, LIFO EA 4022Université d’OrléansOrléansFrance

Personalised recommendations