No-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods
In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. T...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kharazmi University
2014-05-01
|
| Series: | International Journal of Supply and Operations Management |
| Subjects: | |
| Online Access: | http://ijsom.com/article_1903_366.html |