Two-machine flow shops with an optimal permutation schedule under a storage constraint

2019 ◽  
Vol 23 (3) ◽  
pp. 327-336 ◽  
Author(s):  
Yunhong Min ◽  
Byung-Cheon Choi ◽  
Myoung-Ju Park
Keyword(s):  
Flow Shops ◽  
Optimal Permutation ◽  
Permutation Schedule ◽  
Storage Constraint

Counterexamples to optimal permutation schedules for certain flow shop problems

1981 ◽  
Vol 28 (2) ◽  
pp. 339-340 ◽  
Author(s):  
S. S. Panwalkar ◽  
M. L. Smith ◽  
C. R. Woollam
Keyword(s):  
Flow Shop ◽  
Optimal Permutation

Minimizing makespan in reentrant flow-shops using hybrid tabu search

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

Three stage no-idle flow-shops

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

scholarly journals EVOLUTIONARY ALGORITHMS FOR RESOURCE CONSTRAINED NON-SERIAL MIXED FLOW SHOPS

2003 ◽  
Vol 03 (04) ◽  
pp. 411-435 ◽  
Author(s):  
ROBERT L. BURDETT ◽  
ERHAN KOZAN
Keyword(s):  
Evolutionary Algorithms ◽  
Numerical Investigation ◽  
Flow Shop ◽  
Resource Constrained ◽  
Mixed Flow ◽  
Flow Shops ◽  
Constrained Flow

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.

Sign in / Sign up

Export Citation Format

Share Document