A Two-phase Heuristic Algorithm for No-wait Flow Shop Scheduling

ESSE 2017 ◽  
2017 ◽  
pp. 477-486
Keyword(s):  
Heuristic Algorithm ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Two Phase ◽  
Shop Scheduling ◽  
No Wait

scholarly journals A two-phase fuzzy programming model for a complex bi-objective no-wait flow shop scheduling

2012 ◽  
Vol 3 (4) ◽  
pp. 617-626 ◽  
Author(s):  
Mahdi Naderi-Beni ◽  
Reza Tavakkoli-Moghaddam ◽  
Bahman Naderi ◽  
Ehsan Ghobadian ◽  
Alireza Pourrousta
Keyword(s):  
Flow Shop ◽  
Programming Model ◽  
Fuzzy Programming ◽  
Flow Shop Scheduling ◽  
Two Phase ◽  
Shop Scheduling ◽  
No Wait ◽  
Fuzzy Programming Model

The Research of Heuristic Algorithm for Flow Shop Scheduling Problem

2012 ◽  
Vol 605-607 ◽  
pp. 528-531
Author(s):  
Dan Tang ◽  
Hong Ping Shu
Keyword(s):  
Heuristic Algorithm ◽  
Processing Time ◽  
Flow Shop ◽  
Heuristic Method ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Average Quality ◽  
Simulation Experiments ◽  
Shop Scheduling ◽  
Better Than

For the flow shop scheduling problem which aims to minimize makespan, this paper gives a new derivation about its mathematical definition, and mining characteristics of the problem itself further. By which analysis, the new heuristic method proposed in the paper shorten the waiting time of each job as much as possible on the basis of reduce the processing time of the first machine and last job. The result of simulation experiments shows that, our new heuristic algorithm has good performance, and the average quality and stability of scheduling sequences generated by new method is significantly better than other heuristic algorithm which has the same complexity.

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