Advertisement

Journal of Combinatorial Optimization

, Volume 29, Issue 1, pp 36–52 | Cite as

A combination of flow shop scheduling and the shortest path problem

  • Kameng Nip
  • Zhenbo WangEmail author
  • Fabrice Talla Nobibon
  • Roel Leus
Article

Abstract

This paper studies a combinatorial optimization problem which is obtained by combining the flow shop scheduling problem and the shortest path problem. The objective of the obtained problem is to select a subset of jobs that constitutes a feasible solution to the shortest path problem, and to execute the selected jobs on the flow shop machines to minimize the makespan. We argue that this problem is NP-hard even if the number of machines is two, and is NP-hard in the strong sense for the general case. We propose an intuitive approximation algorithm for the case where the number of machines is an input, and an improved approximation algorithm for fixed number of machines.

Keywords

Approximation algorithm Combination of optimization problems Flow shop scheduling Shortest path 

Notes

Acknowledgments

This study has been supported by the Bilateral Scientific Cooperation Project BIL10/10 between Tsinghua University and KU Leuven, and Wang’s research work has been supported by NSFC No. 11371216.

References

  1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood CliffszbMATHGoogle Scholar
  2. Aissi H, Bazgan C, Vanderpooten D (2006) Approximating min–max (regret) versions of some polynomial problems. In: Chen D, Pardolos PM (eds) COCOON 2006, LNCS, vol 4112. Springer, Heidelberg, pp 428–438Google Scholar
  3. Batagelj V, Brandenburg FJ, Mendez P, Sen A (2000) The generalized shortest path problem. CiteSeer Archives.Google Scholar
  4. Bodlaender HL, Jansen K, Woeginger GJ (1994) Scheduling with incompatible jobs. Disc Appl Math 55:219–232CrossRefzbMATHMathSciNetGoogle Scholar
  5. Chen B, Glass CA, Potts CN, Strusevich VA (1996) A new heuristic for three-machine flow shop scheduling. Oper Res 44:891–898CrossRefzbMATHGoogle Scholar
  6. Conway RW, Maxwell W, Miller L (1967) Theory of scheduling. Addison-Wesley, ReadingGoogle Scholar
  7. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271CrossRefzbMATHMathSciNetGoogle Scholar
  8. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117–129CrossRefzbMATHMathSciNetGoogle Scholar
  9. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San FranciscozbMATHGoogle Scholar
  10. Gonzalez T, Sahni S (1978) Flowshop and jobshop schedules: complexity and approximation. Oper Res 26:36–52CrossRefzbMATHMathSciNetGoogle Scholar
  11. Hall LA (1998) Approximability of flow shop scheduling. Math Program 82:175–190zbMATHGoogle Scholar
  12. Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q 1:61–68CrossRefGoogle Scholar
  13. Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer, BostonCrossRefzbMATHGoogle Scholar
  14. Monma CL, Rinnooy Kan AHG (1983) A concise survey of eciently solvable special cases of the permutation flow-shop problem. RAIRO Rech Oper 17:105–119zbMATHMathSciNetGoogle Scholar
  15. Röck H, Schmidt G (1982) Machine aggregation heuristics in shop scheduling. Method Oper Res 45:303–314Google Scholar
  16. Wang Z, Cui Z (2012) Combination of parallel machine scheduling and vertex cover. Theor Comput Sci 460:10–15CrossRefzbMATHMathSciNetGoogle Scholar
  17. Wang Z, Hong W, He D (2013) Combination of parallel machine scheduling and covering problem. Working paper, Tsinghua UniversityGoogle Scholar
  18. Warburton A (1987) Approximation of pareto optima in multiple-objective, shortest-path problems. Oper Res 35:70–79CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Kameng Nip
    • 1
  • Zhenbo Wang
    • 1
    Email author
  • Fabrice Talla Nobibon
    • 2
  • Roel Leus
    • 3
  1. 1.Department of Mathematical SciencesTsinghua UniversityBeijingChina
  2. 2.Research Foundation–Flanders, ORSTAT, Faculty of Economics and BusinessKU LeuvenLeuvenBelgium
  3. 3.ORSTAT, Faculty of Economics and BusinessKU LeuvenLeuvenBelgium

Personalised recommendations