Abstract
Heuristics for no-wait flow shop scheduling problem
Highlights
Scheduling is regarded as decision making process in manufacturing and serving industries to allocate the resources to tasks over a given time interval to optimize one or several criteria
The work in this paper presented an alternative constructive heuristic algorithm along with an improvement heuristic algorithm for solving no-wait permutation flow shop scheduling problems with the criteria of minimizing makespan
The PCH algorithm can be the better initial solution than the NEH used by many metaheuristics existing in the literature
Summary
Scheduling is regarded as decision making process in manufacturing and serving industries to allocate the resources to tasks over a given time interval to optimize one or several criteria. For maintaining the continuous flow of jobs, the processing of jobs is delayed on the first machine so that the jobs do not wait in the subsequent processing on machines Some such typical examples of manufacturing include metal casting, plastic manufacturing and food industries can be found in Aldowaisan and Allahverdi (2004). The problem of scheduling of jobs with the objective as makespan with no-wait constraint in flow shop has been studied by many researchers. Chaudhry and Munem Khan (2012) presented a spreadsheet based genetic algorithm (GA) approach to minimize makespan under no-wait situation for scheduling n-jobs through m-machines. We present a constructive and an efficient improvement heuristic for solving n-job, m-machine flow shop scheduling problem without interruptions in processing of jobs with criteria of minimizing makespan.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
