scholarly journals Heuristic Approach for N-Job, 3-Machine Flow Shop Scheduling Problem Involving Transportation Time, Break Down Time and Weights of Jobs

2005 ◽  
Vol 10 (2) ◽  
pp. 301-305 ◽  
Author(s):  
A. Chandramouli
Keyword(s):  
Flow Shop ◽  
Heuristic Approach ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Transportation Time ◽  
Shop Scheduling

scholarly journals A better heuristic approach for n-job m-machine flow shop scheduling problem

10.26524/cm71 ◽  
2020 ◽  
Vol 4 (1) ◽  
Author(s):  
Vasudevan G ◽  
Jayakumar Dr ◽  
Sathiya shanthi R
Keyword(s):  
Flow Shop ◽  
Simple Approach ◽  
Heuristic Approach ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Rectangular Matrix ◽  
Matrix Problems ◽  
Optimum Solution

Scheduling problem has its origin in manufacturing industry.In this paper we describe a simple approach for solving the flow shop scheduling problem. The result we obtained has been compared with Palmers Heuristic and CDS algorithms along with NEH. It was found that our method will reach near optimum solution within few steps compared to CDS and NEHalgorithm and yield better result compared to Palmers Heuristic with objective of minimizing the Makespan for the horizontal rectangular matrix problems.

scholarly journals A Flow Shop Scheduling Problem with Transportation Time and Separated Setup Time of Jobs

2012 ◽  
Vol 38 ◽  
pp. 1327-1332 ◽  
Author(s):  
S. Agrawal ◽  
A. Gautam ◽  
D.K. Chauhan ◽  
L.M. Tiwari ◽  
S. Kapoor
Keyword(s):  
Flow Shop ◽  
Setup Time ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Transportation Time ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document