Scheduling job families with setups on a single machine | ||
| journal of kerbala university | ||
| Article 1, Volume 8, Issue 0, March 2012, Pages 99-113 PDF (0 K) | ||
| Author | ||
| Hussam Abid Ali Mohammed | ||
| Abstract | ||
| Many sequencing problems have a combinatorial nature and they are very difficult to optimality within acceptable computation times. We consider the problem of scheduling jobs on a single machine minimize the maximum completion time and maximum weighted earliness time. The jobs partitional into families, and a setup time is necessary for scheduling the fest job and when there is a switch in processing jobs from one family to jobs of another family. And to solve this problem we suggested method heuristic to compare and test different local search method. | ||
|
Statistics Article View: 140 PDF Download: 62 |
||