366
Views
22
CrossRef citations to date
0
Altmetric
Articles

Minimising makespan in flowshop group scheduling with sequence-dependent family set-up times using inserted idle times

, &
Pages 1791-1806 | Received 03 Apr 2014, Accepted 22 Aug 2014, Published online: 25 Sep 2014

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

Read on this site (4)

Benedikt Zipfel, Janis Neufeld & Udo Buscher. (2024) An iterated local search for customer order scheduling in additive manufacturing. International Journal of Production Research 62:3, pages 605-625.
Read now
Nilgün İnce, Derya Deliktaş & İhsan Hakan Selvi. (2023) A comprehensive literature review of the flowshop group scheduling problems: systematic and bibliometric reviews. International Journal of Production Research 0:0, pages 1-30.
Read now
J. S. Neufeld, F. F. Teucher & U. Buscher. (2020) Scheduling flowline manufacturing cells with inter-cellular moves: non-permutation schedules and material flows in the cell scheduling problem. International Journal of Production Research 58:21, pages 6568-6584.
Read now
Sicheng Zhang & T.N. Wong. (2016) Studying the impact of sequence-dependent set-up times in integrated process planning and scheduling with E-ACO heuristic. International Journal of Production Research 54:16, pages 4815-4838.
Read now

Articles from other publishers (18)

Xuan He, Quan-Ke Pan, Liang Gao, Janis S. Neufeld & Jatinder N.D. Gupta. (2024) Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times. Omega 123, pages 102997.
Crossref
Hui Zhao, Quan-Ke Pan & Kai-Zhou Gao. (2023) A cooperative population-based iterated greedy algorithm for distributed permutation flowshop group scheduling problem. Engineering Applications of Artificial Intelligence 125, pages 106750.
Crossref
Xuan He, Quan-Ke Pan, Liang Gao & Janis S. Neufeld. (2023) An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem. European Journal of Operational Research 310:2, pages 597-610.
Crossref
Yuting Wang, Yuyan Han, Dunwei Gong & Huan Li. (2023) A review of intelligent optimization for group scheduling problems in cellular manufacturing. Frontiers of Engineering Management 10:3, pages 406-426.
Crossref
Xuan He, Quan-Ke Pan, Liang Gao, Ling Wang & Ponnuthurai Nagaratnam Suganthan. (2023) A Greedy Cooperative Co-Evolutionary Algorithm With Problem-Specific Knowledge for Multiobjective Flowshop Group Scheduling Problems. IEEE Transactions on Evolutionary Computation 27:3, pages 430-444.
Crossref
Biao Zhang, Chao Lu, Lei-lei Meng, Yu-yan Han, Hong-yan Sang & Xu-chu Jiang. (2023) Reconfigurable distributed flowshop group scheduling with a nested variable neighborhood descent algorithm. Expert Systems with Applications 217, pages 119548.
Crossref
Haoxiang Qin, Yuyan Han, Yuting Wang, Yiping Liu, Junqing Li & Quanke Pan. (2022) Intelligent optimization under blocking constraints: A novel iterated greedy algorithm for the hybrid flow shop group scheduling problem. Knowledge-Based Systems 258, pages 109962.
Crossref
Zhi-Yuan Wang, Quan-Ke Pan, Liang Gao & Yu-Long Wang. (2022) An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem. Swarm and Evolutionary Computation 74, pages 101143.
Crossref
Zhi-Yuan Wang, Yiran Pan & Quan-Ke Pan. (2022) Minimizing Total Tardiness in the Distributed Flowshop Group Scheduling Problem with an Iterated Greedy Algorithm. Minimizing Total Tardiness in the Distributed Flowshop Group Scheduling Problem with an Iterated Greedy Algorithm.
Quan-Ke Pan, Liang Gao & Ling Wang. (2022) An Effective Cooperative Co-Evolutionary Algorithm for Distributed Flowshop Group Scheduling Problems. IEEE Transactions on Cybernetics 52:7, pages 5999-6012.
Crossref
Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying & Yi-Hsiu Liao. (2021) New benchmark algorithms for No-wait Flowshop Group Scheduling Problem with Sequence-Dependent Setup Times. Applied Soft Computing 111, pages 107705.
Crossref
Xuan He, Yu-Fan Liu, Quan-Ke Pan, Yang Yu & Yuan-Zhen Li. (2021) A Novel Constructive Heuristic for Flowshop Group Scheduling Problems to Minimize Total Flow Time. A Novel Constructive Heuristic for Flowshop Group Scheduling Problems to Minimize Total Flow Time.
Felix Tamke & Nadine Schiebold. 2021. Logistics Management. Logistics Management 151 164 .
Shih-Wei Lin & Kuo-Ching Ying. (2019) Makespan optimization in a no-wait flowline manufacturing cell with sequence-dependent family setup times. Computers & Industrial Engineering 128, pages 1-7.
Crossref
Liji Shen & Jatinder N. D. Gupta. (2017) Family scheduling with batch availability in flow shops to minimize makespan. Journal of Scheduling 21:2, pages 235-249.
Crossref
Wenzhu Liao & Tong Wang. (2018) An optimization approach using in production scheduling with different order. An optimization approach using in production scheduling with different order.
Lei Yue, Zailin Guan, Ullah Saif, Fei Zhang & Hao Wang. (2016) Hybrid Pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects. SpringerPlus 5:1.
Crossref
Janis S. Neufeld, Jatinder N.D. Gupta & Udo Buscher. (2016) A comprehensive review of flowshop group scheduling literature. Computers & Operations Research 70, pages 56-74.
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.