A Two-Stage Cooperative Evolutionary Algorithm With Problem-Specific Knowledge for Energy-Efficient Scheduling of No-Wait Flow-Shop Problem

2020 ◽  
pp. 1-13
Author(s):  
Fuqing Zhao ◽  
Xuan He ◽  
Ling Wang
2014 ◽  
Vol 39 (1) ◽  
pp. 3-16 ◽  
Author(s):  
Enrique Gerstl ◽  
Gur Mosheiov ◽  
Assaf Sarig

Abstract We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage. We assume identical jobs, and the option of batching, with a required setup time prior to the processing of a new batch. We also consider the option to use only a subset of the available machines. The objective is minimum makespan. A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule. The running time of our proposed solution algorithm is independent of the number of jobs, and linear in the number of machines


2012 ◽  
Vol 25 (6) ◽  
pp. 1114-1120 ◽  
Author(s):  
Marcelo Seido Nagano ◽  
Augusto Almeida da Silva ◽  
Luiz Antonio Nogueira Lorena

2000 ◽  
Vol 33 (17) ◽  
pp. 663-668
Author(s):  
Gerd Finke ◽  
Ammar Oulamara

Sign in / Sign up

Export Citation Format

Share Document