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.

Discrete Particle Swarm Optimization Algorithm for Lot-Streaming No-Wait Flow Shop Scheduling Problem

2012 ◽  
Vol 538-541 ◽  
pp. 863-868 ◽  
Author(s):  
Lin Yang ◽  
Yu Xia Pan
Keyword(s):  
Particle Swarm Optimization ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Discrete Particle Swarm Optimization ◽  
Lot Streaming ◽  
Swarm Optimization ◽  
Discrete Particle ◽  
Shop Scheduling ◽  
No Wait

This paper proposed discrete particle swarm optimization(DPSO) algorithm to solve lot-streaming no-wait flow shop scheduling problem(LNFSP) with the objective of the maximum completion time. The natural encoding scheme based on job permutation and newly-designed methods were adopted to produce new individuals . After the DPSO-based exploration, a efficient fast local search based on swap neighborhood structure is used to enhance the exploitation capability. Simulation results show the effectiveness of the proposed algorithms.

Lot Streaming and Preventive Maintenance in a Multiple Product Permutation Flow Shop with Intermingling

2014 ◽  
Vol 564 ◽  
pp. 689-693 ◽  
Author(s):  
Navid Mortezaei ◽  
Zulkifli Norzima ◽  
S.H. Tang ◽  
Mohd Yusuff Rosnah
Keyword(s):  
Mathematical Model ◽  
Preventive Maintenance ◽  
Flow Shop ◽  
Mixed Integer ◽  
Programming Formulation ◽  
Lot Streaming ◽  
Proposed Model ◽  
Permutation Flow Shop ◽  
Integer Linear Model ◽  
Multiple Product

A mathematical model forlot streaming problem with preventive maintenance was proposed. A mixed-integer linear model for multiple-product lot streaming problems was also developed. Mixed-integer programming formulation was presented which will enable the user to identify optimal sublot sizes and sequences simultaneously. Two situations were considered:1) all machines were available, and 2) all machines needed preventive maintenance tasks. For both situations a new mixed-integer formulation was developed. To demonstrate the practicality of the proposed model, numerical example was used. It showed that the percentage of make span reduction due to lot streaming in permutation flow shop is 54% when compared to consistent sublots with intermingling case.

Sign in / Sign up

Export Citation Format

Share Document