Evolutionary algorithms for scheduling m-machine flow shop with lot streaming

2008 ◽  
Vol 24 (1) ◽  
pp. 125-139 ◽  
Author(s):  
S. Marimuthu ◽  
S.G. Ponnambalam ◽  
N. Jawahar
Keyword(s):  
Evolutionary Algorithms ◽  
Flow Shop ◽  
Lot Streaming

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.

scholarly journals Integration of Lot Sizing and Flow Shop Scheduling with Lot Streaming

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Navid Mortezaei ◽  
Norzima Zulkifli
Keyword(s):  
Flow Shop ◽  
Lot Sizing ◽  
Flow Shop Scheduling ◽  
Mixed Integer ◽  
Lot Streaming ◽  
Optimal Sequence ◽  
Shop Scheduling ◽  
Proposed Model ◽  
Integer Linear Model ◽  
No Wait

We will develop a mathematical model for the integration of lot sizing and flow shop scheduling with lot streaming. We will develop a mixed-integer linear model for multiple products lot sizing and lot streaming problems. Mixed-integer programming formulation is presented which will enable the user to find optimal production quantities, optimal inventory levels, optimal sublot sizes, and optimal sequence simultaneously. We will use numerical example to show practicality of the proposed model. We test eight different lot streaming problems: (1) consistent sublots with intermingling, (2) consistent sublots and no intermingling between sublots of the products (without intermingling), (3) equal sublots with intermingling, (4) equal sublots without intermingling, (5) no-wait consistent sublots with intermingling, (6) no-wait equal sublots with intermingling, (7) no-wait consistent sublots without intermingling, and (8) no-wait equal sublots without intermingling. We showed that the best makespan can be achieved through the consistent sublots with intermingling case.

Sign in / Sign up

Export Citation Format

Share Document