428
Views
38
CrossRef citations to date
0
Altmetric
Original Articles

A meta-heuristic approach for solving the no-wait flow-shop problem

&
Pages 7313-7326 | Received 15 Nov 2010, Accepted 01 Dec 2011, Published online: 12 Jan 2012

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (8)

Hyeon-Il Kim & Dong-Ho Lee. (2023) Scheduling algorithms for multi-stage flow shops with reworks under overlapped queue time limits. International Journal of Production Research 61:20, pages 6908-6922.
Read now
Honghan Ye, Wei Li & Barrie R. Nault. (2020) Trade-off balancing between maximum and total completion times for no-wait flow shop production. International Journal of Production Research 58:11, pages 3235-3251.
Read now
Ezra Wari & Weihang Zhu. (2019) A Constraint Programming model for food processing industry: a case for an ice cream processing facility. International Journal of Production Research 57:21, pages 6648-6664.
Read now
Wei Li, Theodor Freiheit & Enming Miao. (2017) A lever concept integrated with simple rules for flow shop scheduling. International Journal of Production Research 55:11, pages 3110-3125.
Read now
Hamed Samarghandi. (2015) A particle swarm optimisation for the no-wait flow shop problem with due date constraints. International Journal of Production Research 53:9, pages 2853-2870.
Read now
Hamed Samarghandi. (2015) Studying the effect of server side-constraints on the makespan of the no-wait flow-shop problem with sequence-dependent set-up times. International Journal of Production Research 53:9, pages 2652-2673.
Read now
Dipak Laha, Jatinder N D Gupta & Sagar U Sapkal. (2014) A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops. Journal of the Operational Research Society 65:10, pages 1611-1624.
Read now
Hamed Samarghandi & Tarek Y. ElMekkawy. (2014) Solving the no-wait flow-shop problem with sequence-dependent set-up times. International Journal of Computer Integrated Manufacturing 27:3, pages 213-228.
Read now

Articles from other publishers (30)

Dana Marsetiya Utama, Sabila Zahra Umamy & Cynthia Novel Al-Imron. (2024) No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis. RAIRO - Operations Research 58:2, pages 1281-1313.
Crossref
Majid Esmaelian, Milad Mohammadi & Hadi Shahmoradi. (2023) New formulation for scheduling flexible flow shop problems. International Journal on Interactive Design and Manufacturing (IJIDeM) 17:6, pages 3305-3319.
Crossref
Sujun Zhang & Xingsheng Gu. (2023) A discrete whale optimization algorithm for the no-wait flow shop scheduling problem. Measurement and Control 56:9-10, pages 1764-1779.
Crossref
Soumen Atta & Goutam Sen. (2021) A new variant of the p-hub location problem with a ring backbone network for content placement in VoD services. Computers & Industrial Engineering 159, pages 107432.
Crossref
Haihong Zhu, Ning Luo & Xiaoping Li. (2021) A quantum‐inspired cuckoo co‐evolutionary algorithm for no‐wait flow shop scheduling. IET Collaborative Intelligent Manufacturing 3:2, pages 105-118.
Crossref
Sujun Zhang, Xingsheng Gu & Funa Zhou. (2020) An Improved Discrete Migrating Birds Optimization Algorithm for the No-Wait Flow Shop Scheduling Problem. IEEE Access 8, pages 99380-99392.
Crossref
Meenakshi Sharma, Manisha Sharma & Sameer Sharma. 2020. Soft Computing for Problem Solving 2019. Soft Computing for Problem Solving 2019 121 135 .
Andreas Hipp & Victor Fernandez-Viagas. (2019) Influence of no-wait and time lag constraints in flowshop scheduling systems. Influence of no-wait and time lag constraints in flowshop scheduling systems.
Chen-Yang Cheng, Kuo-Ching Ying, Shu-Fen Li & Ya-Chu Hsieh. (2019) Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times. Computers & Industrial Engineering 130, pages 338-347.
Crossref
Haihong Zhu, Xuemei Qi, Fulong Chen, Xin He, Linfeng Chen & Ziyang Zhang. (2018) Quantum-inspired cuckoo co-search algorithm for no-wait flow shop scheduling. Applied Intelligence 49:2, pages 791-803.
Crossref
Fuqing Zhao, Feilong Xue, Guoqiang Yang, Weimin Ma, Chuck Zhang & Houbin Song. (2019) A Fitness Landscape Analysis for the No-Wait Flow Shop Scheduling Problem With Factorial Representation. IEEE Access 7, pages 21032-21047.
Crossref
Ali Allahverdi, Harun Aydilek & Asiye Aydilek. (2018) No-wait flowshop scheduling problem with two criteria; total tardiness and makespan. European Journal of Operational Research 269:2, pages 590-601.
Crossref
Vahid Riahi & Morteza Kazemi. (2016) A new hybrid ant colony algorithm for scheduling of no-wait flowshop. Operational Research 18:1, pages 55-74.
Crossref
Shih-Wei Lin, Chung-Cheng Lu & Kuo-Ching Ying. (2018) Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop. IEEE Access 6, pages 78666-78677.
Crossref
Fuqing Zhao, Huan Liu, Yi Zhang, Weimin Ma & Chuck Zhang. (2018) A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem. Expert Systems with Applications 91, pages 347-363.
Crossref
M. Komaki & B. Malakooti. (2017) General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem. Production Engineering 11:3, pages 315-329.
Crossref
Ali Allahverdi. (2016) A survey of scheduling problems with no-wait in process. European Journal of Operational Research 255:3, pages 665-686.
Crossref
Ezra Wari & Weihang Zhu. (2016) Multi-week MILP scheduling for an ice cream processing facility. Computers & Chemical Engineering 94, pages 141-156.
Crossref
Shih-Wei Lin & Kuo-Ching Ying. (2016) Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics. Omega 64, pages 115-125.
Crossref
Weishi Shao, Dechang Pi & Zhongshi Shao. (2016) A hybrid discrete optimization algorithm based on teaching–probabilistic learning mechanism for no-wait flow shop scheduling. Knowledge-Based Systems 107, pages 219-234.
Crossref
Shih-Wei Lin & Kuo-Ching Ying. (2016) Minimizing makespan for solving the distributed no-wait flowshop scheduling problem. Computers & Industrial Engineering 99, pages 202-209.
Crossref
Dipak Laha & Jatinder N.D. Gupta. (2016) A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops. Computers & Industrial Engineering 98, pages 373-383.
Crossref
Hamed Samarghandi & Mehdi Behroozi. (2016) An Enumeration Algorithm for the No-Wait Flow Shop Problem with Due Date Constraints. IFAC-PapersOnLine 49:12, pages 1803-1808.
Crossref
Jian-Ya Ding, Shiji Song, Jatinder N.D. Gupta, Rui Zhang, Raymond Chiong & Cheng Wu. (2015) An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Applied Soft Computing 30, pages 604-613.
Crossref
Hamed Samarghandi. (2015) A no-wait flow shop system with sequence dependent setup times and server constraints. IFAC-PapersOnLine 48:3, pages 1604-1609.
Crossref
Marie-Eléonore Marmion & Olivier Regnier-Coudert. 2015. Learning and Intelligent Optimization. Learning and Intelligent Optimization 151 164 .
Ali Allahverdi & Harun Aydilek. (2014) Total completion time with makespan constraint in no-wait flowshops with setup times. European Journal of Operational Research 238:3, pages 724-734.
Crossref
N. M. L. Costa, M. L. R. Varela & S. Carmo-Silva. (2014) Scheduling in product oriented manufacturing systems. Scheduling in product oriented manufacturing systems.
Olivier Regnier-Coudert & John McCall. 2014. Parallel Problem Solving from Nature – PPSN XIII. Parallel Problem Solving from Nature – PPSN XIII 332 341 .
Rajesh Vanchipura & R. Sridharan. (2013) Effect of Varying Levels of Setup Time on Makespan Criteria: A Comparative Study of Two Algorithms on SDST Flow Shop. Global Journal of Flexible Systems Management 13:3, pages 151-158.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.