haku: @indexterm ALGORITHMS / yhteensä: 403
viite: 160 / 403
| Tekijä: | Strusevich, V.A. |
| Otsikko: | Two-machine super-shop scheduling problem |
| Lehti: | Journal of the Operational Research Society
1991 : JUN, VOL. 42:6, p. 479-492 |
| Asiasana: | SCHEDULING ALGORITHMS |
| Kieli: | eng |
| Tiivistelmä: | The paper introduces the two-machine super-shop scheduling problem to minimize makespan. In this problem there are two machines /A and B/, and set N= /1,2,....n/of jobs. Each job consists of two operations at most. Job i should be processed on machine A within a i time units and on machine B within b i No two jobs can be processed on the same machine and both machines cannot process the same job simultaneously. The objective is to find the schedule s * minimizing the maximum completion time, the makespan. The well-known flow-shop, open-shop, job-shop and mixed-shop problems are special cases of the model. A polynomial-time algorithm to find both pre-emptive and non-pre-emptive optimal schedules is described. |
SCIMA