A heuristic algorithm for scheduling in a flow shop environment to minimize makespan
Scheduling ‘n’ jobs on ‘m’ machines in a flow shop is NP- hard problem and places itself at prominent place in the area of production scheduling. The essence of any scheduling algorithm is to minimize the makespan in a flowshop environment. In this paper an attempt has been made to develop a heurist...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2015-04-01
|
| Series: | International Journal of Industrial Engineering Computations |
| Subjects: | |
| Online Access: | http://www.growingscience.com/ijiec/Vol6/IJIEC_2014_43.pdf |