IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v29y2015i1d10.1007_s10878-013-9670-4.html
   My bibliography  Save this article

A combination of flow shop scheduling and the shortest path problem

Author

Listed:
  • Kameng Nip

    (Tsinghua University)

  • Zhenbo Wang

    (Tsinghua University)

  • Fabrice Talla Nobibon

    (KU Leuven)

  • Roel Leus

    (KU Leuven)

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.

Suggested Citation

  • Kameng Nip & Zhenbo Wang & Fabrice Talla Nobibon & Roel Leus, 2015. "A combination of flow shop scheduling and the shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 36-52, January.
    • Handle: RePEc:spr:jcomop:v:29:y:2015:i:1:d:10.1007_s10878-013-9670-4
    DOI: 10.1007/s10878-013-9670-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9670-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-013-9670-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Teofilo Gonzalez & Sartaj Sahni, 1978. "Flowshop and Jobshop Schedules: Complexity and Approximation," Operations Research, INFORMS, vol. 26(1), pages 36-52, February.
    2. Arthur Warburton, 1987. "Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems," Operations Research, INFORMS, vol. 35(1), pages 70-79, February.
    3. Bo Chen & Celia A. Glass & Chris N. Potts & Vitaly A. Strusevich, 1996. "A New Heuristic for Three-Machine Flow Shop Scheduling," Operations Research, INFORMS, vol. 44(6), pages 891-898, December.
    4. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    5. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yang, Fan & Davari, Morteza & Wei, Wenchao & Hermans, Ben & Leus, Roel, 2022. "Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families," European Journal of Operational Research, Elsevier, vol. 303(2), pages 602-615.
    2. Li Guan & Jianping Li & Weidong Li & Junran Lichen, 2019. "Improved approximation algorithms for the combination problem of parallel machine scheduling and path," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 689-697, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yong Chen & Yinhui Cai & Longcheng Liu & Guangting Chen & Randy Goebel & Guohui Lin & Bing Su & An Zhang, 2022. "Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 571-588, April.
    2. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    3. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    4. D Bai & L Tang, 2010. "New heuristics for flow shop problem to minimize makespan," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(6), pages 1032-1040, June.
    5. Jianming Dong & Ruyan Jin & Jueliang Hu & Guohui Lin, 2019. "A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops," Journal of Combinatorial Optimization, Springer, vol. 37(2), pages 668-684, February.
    6. Shabtay, Dvir & Gilenson, Miri, 2023. "A state-of-the-art survey on multi-scenario scheduling," European Journal of Operational Research, Elsevier, vol. 310(1), pages 3-23.
    7. Jianming Dong & Yong Chen & An Zhang & Qifan Yang, 2013. "A new three-machine shop scheduling: complexity and approximation algorithm," Journal of Combinatorial Optimization, Springer, vol. 26(4), pages 799-810, November.
    8. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    9. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    10. T.C.E. Cheng & B.M.T. Lin & A. Toker, 2000. "Makespan minimization in the two‐machine flowshop batch scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 128-144, March.
    11. Monaci, Marta & Agasucci, Valerio & Grani, Giorgio, 2024. "An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents," European Journal of Operational Research, Elsevier, vol. 312(3), pages 910-926.
    12. J. A. Hoogeveen & T. Kawaguchi, 1999. "Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases," Mathematics of Operations Research, INFORMS, vol. 24(4), pages 887-910, November.
    13. Byung-Cheon Choi & Joseph Y.-T. Leung & Michael L. Pinedo, 2011. "Minimizing makespan in an ordered flow shop with machine-dependent processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 797-818, November.
    14. Thierry Garaix & Salim Rostami & Xiaolan Xie, 2020. "Daily outpatient chemotherapy appointment scheduling with random deferrals," Flexible Services and Manufacturing Journal, Springer, vol. 32(1), pages 129-153, March.
    15. Li, Wei & Nault, Barrie R. & Ye, Honghan, 2019. "Trade-off balancing in scheduling for flow shop production and perioperative processes," European Journal of Operational Research, Elsevier, vol. 273(3), pages 817-830.
    16. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2020. "Scheduling a proportionate flow shop of batching machines," Journal of Scheduling, Springer, vol. 23(5), pages 575-593, October.
    17. Jansen, Klaus & Mastrolilli, Monaldo & Solis-Oba, Roberto, 2005. "Approximation schemes for job shop scheduling problems with controllable processing times," European Journal of Operational Research, Elsevier, vol. 167(2), pages 297-319, December.
    18. J.-C. Billaut & F. Della Croce & F. Salassa & V. T’kindt, 2019. "No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths," Journal of Scheduling, Springer, vol. 22(1), pages 59-68, February.
    19. Zongxu Mu & Minming Li, 2015. "DVS scheduling in a line or a star network of processors," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 16-35, January.
    20. Igor Averbakh & Oded Berman, 1999. "A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems," Operations Research, INFORMS, vol. 47(1), pages 165-170, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:29:y:2015:i:1:d:10.1007_s10878-013-9670-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.