IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v89y1996i1p172-175.html
   My bibliography  Save this article

Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard

Author

Listed:
  • Hoogeveen, J. A.
  • Lenstra, J. K.
  • Veltman, B.

Abstract

No abstract is available for this item.

Suggested Citation

  • Hoogeveen, J. A. & Lenstra, J. K. & Veltman, B., 1996. "Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard," European Journal of Operational Research, Elsevier, vol. 89(1), pages 172-175, February.
    • Handle: RePEc:eee:ejores:v:89:y:1996:i:1:p:172-175
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)90070-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    2. Brah, Shaukat A. & Hunsucker, John L., 1991. "Branch and bound algorithm for the flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 51(1), pages 88-99, March.
    3. Sriskandarajah, C. & Sethi, S. P., 1989. "Scheduling algorithms for flexible flowshops: Worst and average case performance," European Journal of Operational Research, Elsevier, vol. 43(2), pages 143-160, November.
    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. Janiak, Adam & Kozan, Erhan & Lichtenstein, Maciej & Oguz, Ceyda, 2007. "Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion," International Journal of Production Economics, Elsevier, vol. 105(2), pages 407-424, February.
    2. Moursli, O. & Pochet, Y., 2000. "A branch-and-bound algorithm for the hybrid flowshop," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 113-125, March.
    3. Kis, Tamas & Pesch, Erwin, 2005. "A review of exact solution methods for the non-preemptive multiprocessor flowshop problem," European Journal of Operational Research, Elsevier, vol. 164(3), pages 592-608, August.
    4. F Sivrikaya şerifoğlu & G Ulusoy, 2004. "Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(5), pages 504-512, May.
    5. Figielska, Ewa, 2014. "A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages," European Journal of Operational Research, Elsevier, vol. 236(2), pages 433-444.
    6. Zhang, Xiandong & van de Velde, Steef, 2012. "Approximation algorithms for the parallel flow shop problem," European Journal of Operational Research, Elsevier, vol. 216(3), pages 544-552.
    7. Kamran Kianfar & Arezoo Atighehchian, 2023. "A hybrid heuristic approach to master surgery scheduling with downstream resource constraints and dividable operating room blocks," Annals of Operations Research, Springer, vol. 328(1), pages 727-754, September.
    8. Kyparisis, George J. & Koulamas, Christos, 2006. "Flexible flow shop scheduling with uniform parallel machines," European Journal of Operational Research, Elsevier, vol. 168(3), pages 985-997, February.
    9. Bertel, S. & Billaut, J. -C., 2004. "A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation," European Journal of Operational Research, Elsevier, vol. 159(3), pages 651-662, December.
    10. Negenman, Ebbe G., 2001. "Local search algorithms for the multiprocessor flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(1), pages 147-158, January.
    11. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    12. Byung-Cheon Choi & Kangbok Lee, 2013. "Two-stage proportionate flexible flow shop to minimize the makespan," Journal of Combinatorial Optimization, Springer, vol. 25(1), pages 123-134, January.
    13. Niu, Qun & Zhou, Taijin & Fei, Minrui & Wang, Bing, 2012. "An efficient quantum immune algorithm to minimize mean flow time for hybrid flow shop problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 84(C), pages 1-25.
    14. Mohamed Haouari & Lotfi Hidri & Anis Gharbi, 2006. "Optimal Scheduling of a Two-stage Hybrid Flow Shop," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 107-124, August.
    15. Christos Koulamas & George J. Kyparisis, 2000. "Asymptotically optimal linear time algorithms for two‐stage and three‐stage flexible flow shops," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 259-268, April.
    16. Djellab, Housni & Djellab, Khaled, 2002. "Preemptive Hybrid Flowshop Scheduling problem of interval orders," European Journal of Operational Research, Elsevier, vol. 137(1), pages 37-49, February.
    17. Gerstl, Enrique & Mosheiov, Gur, 2014. "A two-stage flexible flow shop problem with unit-execution-time jobs and batching," International Journal of Production Economics, Elsevier, vol. 158(C), pages 171-178.
    18. Jianming Dong & Joshua Chang & Bing Su & Jueliang Hu & Guohui Lin, 2020. "Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments," Journal of Scheduling, Springer, vol. 23(5), pages 595-608, October.
    19. 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.
    20. A. G. Leeftink & R. J. Boucherie & E. W. Hans & M. A. M. Verdaasdonk & I. M. H. Vliegen & P. J. Diest, 2018. "Batch scheduling in the histopathology laboratory," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 171-197, June.
    21. George J. Kyparisis & Christos Koulamas, 2002. "Assembly-Line Scheduling with Concurrent Operations and Parallel Machines," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 68-80, February.
    22. Joaquín Bautista-Valhondo & Rocío Alfaro-Pozo, 2020. "Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 5-23, March.

    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. Ann Vandevelde & Han Hoogeveen & Cor Hurkens & Jan Karel Lenstra, 2005. "Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 305-320, August.
    2. Lin, Hung-Tso & Liao, Ching-Jong, 2003. "A case study in a two-stage hybrid flow shop with setup time and dedicated machines," International Journal of Production Economics, Elsevier, vol. 86(2), pages 133-143, November.
    3. Djellab, Housni & Djellab, Khaled, 2002. "Preemptive Hybrid Flowshop Scheduling problem of interval orders," European Journal of Operational Research, Elsevier, vol. 137(1), pages 37-49, February.
    4. Mohamed Haouari & Lotfi Hidri & Anis Gharbi, 2006. "Optimal Scheduling of a Two-stage Hybrid Flow Shop," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 107-124, August.
    5. Suresh, V., 1997. "A note on scheduling of two-stage flow shop with multiple processors," International Journal of Production Economics, Elsevier, vol. 49(1), pages 77-82, March.
    6. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1998. "The flow shop with parallel machines: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 226-253, April.
    7. Kis, Tamas & Pesch, Erwin, 2005. "A review of exact solution methods for the non-preemptive multiprocessor flowshop problem," European Journal of Operational Research, Elsevier, vol. 164(3), pages 592-608, August.
    8. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    9. Sun, Xi & Morizawa, Kazuko & Nagasawa, Hiroyuki, 2003. "Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 146(3), pages 498-516, May.
    10. Néron, Emmanuel & Baptiste, Philippe & Gupta, Jatinder N. D., 2001. "Solving hybrid flow shop problem using energetic reasoning and global operations," Omega, Elsevier, vol. 29(6), pages 501-511, December.
    11. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.
    12. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    13. Kurz, Mary E. & Askin, Ronald G., 2003. "Comparing scheduling rules for flexible flow lines," International Journal of Production Economics, Elsevier, vol. 85(3), pages 371-388, September.
    14. Kurz, Mary E. & Askin, Ronald G., 2004. "Scheduling flexible flow lines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 159(1), pages 66-82, November.
    15. Ruiz, Ruben & Maroto, Concepcion, 2006. "A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility," European Journal of Operational Research, Elsevier, vol. 169(3), pages 781-800, March.
    16. Liu Guiqing & Li Kai & Cheng Bayi, 2015. "Preemptive Scheduling with Controllable Processing Times on Parallel Machines," Journal of Systems Science and Information, De Gruyter, vol. 3(1), pages 68-76, February.
    17. Zhen Song & Håkan Schunnesson & Mikael Rinne & John Sturgul, 2015. "Intelligent Scheduling for Underground Mobile Mining Equipment," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-21, June.
    18. Azizoglu, Meral & Cakmak, Ergin & Kondakci, Suna, 2001. "A flexible flowshop problem with total flow time minimization," European Journal of Operational Research, Elsevier, vol. 132(3), pages 528-538, August.
    19. Yung-Chia Chang & Kuei-Hu Chang & Ching-Ping Zheng, 2022. "Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards," Mathematics, MDPI, vol. 10(13), pages 1-21, July.
    20. Carlos Paternina-Arboleda & Jairo Montoya-Torres & Milton Acero-Dominguez & Maria Herrera-Hernandez, 2008. "Scheduling jobs on a k-stage flexible flow-shop," Annals of Operations Research, Springer, vol. 164(1), pages 29-40, November.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:89:y:1996:i:1:p:172-175. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.