scholarly journals A New Approach Generating Robust and Stable Schedules in m-Machine Flow Shop Scheduling Problems: A Case Study

2020 ◽  
Vol 33 (2) ◽  
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
New Approach ◽  
Shop Scheduling

A New Approach for Solving the Flow Shop Scheduling Problem Through Neural Network Technique With Known Breakdown Time and Weights of Jobs

2021 ◽  
Vol 12 (1) ◽  
pp. 77-96
Author(s):  
Harendra Kumar ◽  
Shailendra Giri
Keyword(s):  
Neural Network ◽  
Flow Shop ◽  
Flow Time ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
New Approach ◽  
Shop Scheduling ◽  
Processing Times ◽  
Breakdown Time ◽  
Major Constraint

This paper considers a flow shop scheduling problems of n jobs on m machines involving processing times and weights of jobs with the major constraint as breakdown times of the machines. In this paper a new procedure is provided to obtain an optimal job sequence with the objective of minimize the makespan and mean weighted flow time by using neural network technique. To illustrate the proposed method procedure, a numerical example is given. The effectiveness of the proposed method is compared with many problems which are taken from different papers. This paper also provides a comparison of our proposed method with the existing methods in literature.

Two-machine flow shop scheduling problems with minimal and maximal delays

4OR ◽  
2006 ◽  
Vol 4 (1) ◽  
pp. 15-28 ◽  
Author(s):  
Jean-Louis Bouquard ◽  
Christophe Lenté
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document