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

The proportionate two-machine no-wait job shop scheduling problemAuthor-Name: Koulamas, Christos

Author

Listed:
  • Panwalkar, S.S.

Abstract

We consider the two-machine no-wait job shop minimum makespan scheduling problem. We show that when each job has exactly two equal length operations (also called a proportionate job shop), the problem is solvable in O(nlog n) time. We also show that the proportionate problem becomes strongly NP-hard when some jobs are allowed to visit only one machine. Finally, we show that the proportionate problem with missing operations becomes solvable in O(nlog n) time when all missing operations are on the same machine.

Suggested Citation

  • Panwalkar, S.S., 2016. "The proportionate two-machine no-wait job shop scheduling problemAuthor-Name: Koulamas, Christos," European Journal of Operational Research, Elsevier, vol. 252(1), pages 131-135.
    • Handle: RePEc:eee:ejores:v:252:y:2016:i:1:p:131-135
    DOI: 10.1016/j.ejor.2016.01.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716000175
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.01.010?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. Sriskandarajah, Chelliah & Ladet, Pierre, 1986. "Some no-wait shops scheduling problems: Complexity aspect," European Journal of Operational Research, Elsevier, vol. 24(3), pages 424-438, March.
    2. Panwalkar, S.S. & Koulamas, Christos, 2014. "The two-machine no-wait general and proportionate open shop makespan problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 471-475.
    3. Sartaj Sahni & Yookun Cho, 1979. "Complexity of Scheduling Shops with No Wait in Process," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 448-457, 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. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    2. Ren, Yaping & Zhang, Chaoyong & Zhao, Fu & Xiao, Huajun & Tian, Guangdong, 2018. "An asynchronous parallel disassembly planning based on genetic algorithm," European Journal of Operational Research, Elsevier, vol. 269(2), pages 647-660.

    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. Raaymakers, W. H. M. & Hoogeveen, J. A., 2000. "Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing," European Journal of Operational Research, Elsevier, vol. 126(1), pages 131-151, October.
    2. Abdennour Azerine & Mourad Boudhar & Djamal Rebaine, 2022. "A two-machine no-wait flow shop problem with two competing agents," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 168-199, January.
    3. Zhu, Jie & Li, Xiaoping & Wang, Qian, 2009. "Complete local search with limited memory algorithm for no-wait job shops to minimize makespan," European Journal of Operational Research, Elsevier, vol. 198(2), pages 378-386, October.
    4. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    5. Lin, Hung-Tso & Lee, Hong-Tau & Pan, Wen-Jung, 2008. "Heuristics for scheduling in a no-wait open shop with movable dedicated machines," International Journal of Production Economics, Elsevier, vol. 111(2), pages 368-377, February.
    6. Weiya Zhong & Yun Shi, 2018. "Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 108-125, January.
    7. Celia A. Glass & Yakov M. Shafransky & Vitaly A. Strusevich, 2000. "Scheduling for parallel dedicated machines with a single server," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(4), pages 304-328, June.
    8. Christoph Schuster, 2006. "No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 473-491, July.
    9. Kravchenko, Svetlana A., 1998. "A polynomial algorithm for a two-machine no-wait job-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 106(1), pages 101-107, April.
    10. Abdelhakim AitZai & Brahim Benmedjdoub & Mourad Boudhar, 2016. "Branch-and-bound and PSO algorithms for no-wait job shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(3), pages 679-688, June.
    11. Kim, J-S. & Kang, S-H. & Lee, S. M., 1997. "Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage," Omega, Elsevier, vol. 25(5), pages 547-555, October.
    12. Crama, Yves, 1997. "Combinatorial optimization models for production scheduling in automated manufacturing systems," European Journal of Operational Research, Elsevier, vol. 99(1), pages 136-153, May.
    13. Jebali, AIda & Hadj Alouane, Atidel B. & Ladet, Pierre, 2006. "Operating rooms scheduling," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 52-62, February.
    14. Chien, Chen-Fu & Tseng, Fang-Pin & Chen, Chien-Hung, 2008. "An evolutionary approach to rehabilitation patient scheduling: A case study," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1234-1253, September.
    15. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    16. Naderi, B. & Zandieh, M., 2014. "Modeling and scheduling no-wait open shop problems," International Journal of Production Economics, Elsevier, vol. 158(C), pages 256-266.
    17. A. Ozolins, 2020. "A new exact algorithm for no-wait job shop problem to minimize makespan," Operational Research, Springer, vol. 20(4), pages 2333-2363, December.
    18. Panwalkar, S.S. & Koulamas, Christos, 2014. "The two-machine no-wait general and proportionate open shop makespan problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 471-475.
    19. Nikhil Bansal & Mohammad Mahdian & Maxim Sviridenko, 2005. "Minimizing Makespan in No-Wait Job Shops," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 817-831, November.
    20. Giaro, Krzysztof, 2001. "NP-hardness of compact scheduling in simplified open and flow shops," European Journal of Operational Research, Elsevier, vol. 130(1), pages 90-98, April.

    More about this item

    Keywords

    Job shop; No-wait; Proportionate;
    All these keywords.

    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:252:y:2016:i:1:p:131-135. 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.