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

Total completion time with makespan constraint in no-wait flowshops with setup times

Author

Listed:
  • Allahverdi, Ali
  • Aydilek, Harun

Abstract

The m-machine no-wait flowshop scheduling problem with the objective of minimizing total completion time subject to the constraint that the makespan value is not greater than a certain value is addressed in this paper. Setup times are considered non-zero values, and thus, setup times are treated as separate from processing times. Several recent algorithms, an insertion algorithm, two genetic algorithms, three simulated annealing algorithms, two cloud theory-based simulated annealing algorithms, and a differential evolution algorithm are adapted and proposed for the problem. An extensive computational analysis has been conducted for the evaluation of the proposed algorithms. The computational analysis indicates that one of the nine proposed algorithms, one of the simulated annealing algorithms (ISA-2), performs much better than the others under the same computational time. Moreover, the analysis indicates that the algorithm ISA-2 performs significantly better than the earlier existing best algorithm. Specifically, the best performing algorithm, ISA-2, proposed in this paper reduces the error of the existing best algorithm in the literature by at least 90% under the same computational time. All the results have been statistically tested.

Suggested Citation

  • Allahverdi, Ali & Aydilek, Harun, 2014. "Total completion time with makespan constraint in no-wait flowshops with setup times," European Journal of Operational Research, Elsevier, vol. 238(3), pages 724-734.
    • Handle: RePEc:eee:ejores:v:238:y:2014:i:3:p:724-734
    DOI: 10.1016/j.ejor.2014.04.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714003737
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.04.031?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. A Allahverdi & T Aldowaisan, 2002. "No-wait flowshops with bicriteria of makespan and total completion time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(9), pages 1004-1015, September.
    2. Rubén Ruiz & Ali Allahverdi, 2007. "Some effective heuristics for no-wait flowshops with setup times to minimize total completion time," Annals of Operations Research, Springer, vol. 156(1), pages 143-171, December.
    3. Pang, King-Wah, 2013. "A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness," International Journal of Production Economics, Elsevier, vol. 141(1), pages 127-136.
    4. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    5. Arezoo Atighehchian & Mohammad Mehdi Sepehri, 2013. "An environment-driven, function-based approach to dynamic single-machine scheduling," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(1), pages 100-118.
    6. Chen-Fu Chien & Stephane Dauzere-Peres & Hans Ehm & John W. Fowler & Zhibin Jiang & Shekar Krishnaswamy & Tae-Eog Lee & Lars Monch & Reha Uzsoy, 2011. "Modelling and analysis of semiconductor manufacturing in a shrinking world: challenges and successes," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 5(3), pages 254-271.
    7. Nicholas G. Hall & Marc E. Posner, 2001. "Generating Experimental Data for Computational Testing with Machine Scheduling Applications," Operations Research, INFORMS, vol. 49(6), pages 854-865, December.
    8. Yunqiang Yin & Chin-Chia Wu & Wen-Hung Wu & Juei-Chao Chen, 2013. "Single-machine group scheduling with a general learning effect," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(3), pages 350-369.
    9. Framinan, Jose M. & Leisten, Rainer, 2006. "A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 28-40, February.
    10. Nicholas G. Hall & Chelliah Sriskandarajah, 1996. "A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process," Operations Research, INFORMS, vol. 44(3), pages 510-525, June.
    11. Cédric Pessan & Emmanuel Néron & Mohamed Haouari, 2013. "Development of lower bounds for the scheduling of setup tasks in serial production lines," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(5), pages 558-576.
    12. Allahverdi, Ali & Soroush, H.M., 2008. "The significance of reducing setup times/setup costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 978-984, June.
    13. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    14. Tseng, Lin-Yu & Lin, Ya-Tai, 2010. "A hybrid genetic algorithm for no-wait flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 128(1), pages 144-152, November.
    15. 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.
    16. Radosław Rudek, 2013. "Minimising maximum lateness in a single machine scheduling problem with processing time-based aging effects," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(2), pages 206-223.
    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, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
    2. 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.
    3. Ivan Kristianto Singgih & Onyu Yu & Byung-In Kim & Jeongin Koo & Seungdoe Lee, 2020. "Production scheduling problem in a factory of automobile component primer painting," Journal of Intelligent Manufacturing, Springer, vol. 31(6), pages 1483-1496, August.
    4. Pourvaziri, Hani & Pierreval, Henri, 2017. "Dynamic facility layout problem based on open queuing network theory," European Journal of Operational Research, Elsevier, vol. 259(2), pages 538-553.
    5. Zhe Liu & Shurong Li, 2022. "A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm," Annals of Operations Research, Springer, vol. 311(2), pages 853-898, April.
    6. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
    7. Allahverdi, Ali & Aydilek, Harun & Aydilek, Asiye, 2018. "No-wait flowshop scheduling problem with two criteria; total tardiness and makespan," European Journal of Operational Research, Elsevier, vol. 269(2), pages 590-601.
    8. Xiong, Fuli & Xing, Keyi & Wang, Feng, 2015. "Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time," European Journal of Operational Research, Elsevier, vol. 240(2), pages 338-354.

    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. 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. Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
    3. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    4. Allahverdi, Ali & Aydilek, Harun & Aydilek, Asiye, 2018. "No-wait flowshop scheduling problem with two criteria; total tardiness and makespan," European Journal of Operational Research, Elsevier, vol. 269(2), pages 590-601.
    5. Stefansdottir, Bryndis & Grunow, Martin & Akkerman, Renzo, 2017. "Classifying and modeling setups and cleanings in lot sizing and scheduling," European Journal of Operational Research, Elsevier, vol. 261(3), pages 849-865.
    6. Sheikh, Shaya & Komaki, G.M. & Kayvanfar, Vahid & Teymourian, Ehsan, 2019. "Multi-Stage assembly flow shop with setup time and release time," Operations Research Perspectives, Elsevier, vol. 6(C).
    7. Pang, King-Wah, 2013. "A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness," International Journal of Production Economics, Elsevier, vol. 141(1), pages 127-136.
    8. Gharbi, Anis & Ladhari, Talel & Msakni, Mohamed Kais & Serairi, Mehdi, 2013. "The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies," European Journal of Operational Research, Elsevier, vol. 231(1), pages 69-78.
    9. Dominik Kress & David Müller & Jenny Nossack, 2019. "A worker constrained flexible job shop scheduling problem with sequence-dependent setup times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 179-217, March.
    10. Marko Ɖurasević & Domagoj Jakobović, 2019. "Creating dispatching rules by simple ensemble combination," Journal of Heuristics, Springer, vol. 25(6), pages 959-1013, December.
    11. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    12. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.
    13. Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
    14. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    15. Mohammad Reza Hosseinzadeh & Mehdi Heydari & Mohammad Mahdavi Mazdeh, 2022. "Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time," Operational Research, Springer, vol. 22(5), pages 5055-5105, November.
    16. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    17. Anne Benoit & Mathias Coqblin & Jean-Marc Nicod & Veronika Rehn-Sonigo, 2016. "Optimizing memory allocation for multistage scheduling including setup times," Journal of Scheduling, Springer, vol. 19(6), pages 641-658, December.
    18. Lin, Shih-Wei & Ying, Kuo-Ching, 2016. "Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics," Omega, Elsevier, vol. 64(C), pages 115-125.
    19. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.
    20. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.

    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:238:y:2014:i:3:p:724-734. 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.