Flow Shops and Flexible Flow Shops (Deterministic)

Scheduling ◽  
2016 ◽  
pp. 151-181
Author(s):  
Michael L. Pinedo
Keyword(s):  
Omega ◽  
2003 ◽  
Vol 31 (4) ◽  
pp. 311-317 ◽  
Author(s):  
J.M. Framinan ◽  
R. Leisten

2006 ◽  
Vol 34 (3-4) ◽  
pp. 353-361 ◽  
Author(s):  
Jen-Shiang Chen ◽  
Jason Chao-Hsien Pan ◽  
Chien-Kuang Wu
Keyword(s):  

2002 ◽  
Vol 40 (12) ◽  
pp. 2811-2833 ◽  
Author(s):  
D. J. Van Der Zee

2003 ◽  
Vol 44 (3) ◽  
pp. 425-434 ◽  
Author(s):  
Nour El Houda Saadani ◽  
Alain Guinet ◽  
Mohamed Moalla
Keyword(s):  

Author(s):  
ROBERT L. BURDETT ◽  
ERHAN KOZAN

In this paper the resource-constrained flow shop (RCF) problem is addressed. A number of realistic extensions are incorporated, including non-serial precedence requirements, mixed flow shop situations, and the distribution of the human workforce among a number of pre-determined groups. The RCF is then solved by meta-heuristics, primarily of the evolutionary type. An extensive numerical investigation, including a case study of a particular industrial situation, details the implementation and execution of the heuristics, and the efficiency of the proposed algorithms.


Scheduling ◽  
2011 ◽  
pp. 349-372
Author(s):  
Michael L. Pinedo
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document