Genetic algorithms for minimizing makespan in a flow shop with two capacitated batch processing machines
I tiakina i:
| I whakaputaina i: | The International Journal of Advanced Manufacturing Technology vol. 55, no. 9-12 (Aug 2011), p. 1171 |
|---|---|
| Kaituhi matua: | |
| Ētahi atu kaituhi: | , |
| I whakaputaina: |
Springer Nature B.V.
|
| Ngā marau: | |
| Urunga tuihono: | Citation/Abstract Full Text - PDF |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|
| Whakarāpopotonga: | This paper considers a flow shop with two batch processing machines. The processing times of the job and their sizes are given. The batch processing machines can process multiple jobs simultaneously in a batch as long as the total size of all the jobs in a batch does not exceed its capacity. When the jobs are grouped into batches, the processing time of the batch is defined by the longest processing job in the batch. Batch processing machines are expensive and a bottleneck. Consequently, the objective is to minimize the makespan (or maximize the machine utilization). The scheduling problem under study is NP-hard, hence, a genetic algorithm (GA) is proposed. The effectiveness (in terms of solution quality and run time) of the GA approach is compared with a simulated annealing approach, a heuristic, and a commercial solver which was used to solve a mixed-integer formulation of the problem. Experimental study indicates that the GA approach outperforms the other approaches by reporting better solution. |
|---|---|
| ISSN: | 0268-3768 1433-3015 |
| DOI: | 10.1007/s00170-010-3150-0 |
| Puna: | Engineering Database |