385
Views
10
CrossRef citations to date
0
Altmetric
Original Articles

Minimizing makespan in a two-stage flow shop with parallel batch-processing machines and re-entrant jobs

, , &
Pages 1010-1023 | Received 27 May 2016, Accepted 25 Aug 2016, Published online: 29 Sep 2016

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

Read on this site (7)

Chengkuan Zeng, Zixuan Liu, Jiafu Tang, Zhi-Ping Fan, Chongjun Yan & Siyuan Long. (2023) Bid construction scheme based on local search to solve serial–parallel cooperative batch scheduling problems. Engineering Optimization 55:4, pages 615-631.
Read now
Chengkuan Zeng, Zixuan Liu, Jiafu Tang, Zhi-Ping Fan & Chongjun Yan. (2023) Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint. Engineering Optimization 55:1, pages 71-88.
Read now
Fernando Luis Rossi & Marcelo Seido Nagano. (2021) Heuristics for the mixed no-idle flowshop with sequence-dependent setup times. Journal of the Operational Research Society 72:2, pages 417-443.
Read now
Yonglin Li & Zhenhua Dai. (2020) A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time. Engineering Optimization 52:3, pages 484-506.
Read now
Fuqing Zhao, Lixin Zhang, Huan Liu, Yi Zhang, Weimin Ma, Chuck Zhang & Houbin Song. (2019) An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem. Engineering Optimization 51:10, pages 1727-1742.
Read now
Xu Zheng, Shengchao Zhou & Huaping Chen. (2019) Ant colony optimisation algorithms for two-stage permutation flow shop with batch processing machines and nonidentical job sizes. International Journal of Production Research 57:10, pages 3060-3079.
Read now
Marcelo Seido Nagano, Fernando Luis Rossi & Nádia Junqueira Martarelli. (2019) High-performing heuristics to minimize flowtime in no-idle permutation flowshop. Engineering Optimization 51:2, pages 185-198.
Read now

Articles from other publishers (3)

Maedeh Fasihi, Reza Tavakkoli-Moghaddam & Fariborz Jolai. (2023) A bi-objective re-entrant permutation flow shop scheduling problem: minimizing the makespan and maximum tardiness. Operational Research 23:2.
Crossref
Xiuli Wu, Xiaoyan Yan & Ling Wang. (2022) Optimizing job release and scheduling jointly in a reentrant hybrid flow shop. Expert Systems with Applications 209, pages 118278.
Crossref
JinDian Huang & JianJun Liu. (2018) Hierarchical Production Planning and Real-Time Control for Parallel Batch Machines in a Flow Shop with Incompatible Jobs. Mathematical Problems in Engineering 2018, pages 1-12.
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.