haku: @author Zawack, D. / yhteensä: 1
viite: 1 / 1
« edellinen | seuraava »
| Tekijä: | Adams, J. Balas, E. Zawack, D. |
| Otsikko: | The shifting bottleneck procedure for job shop scheduling. |
| Lehti: | Management Science
1988 : MAR, VOL. 34:3, p. 391-401 |
| Asiasana: | JOB-SHOP SCHEDULING |
| Kieli: | eng |
| Tiivistelmä: | The job shop scheduling or machine sequencing problem is as follows. Jobs are to be processed on machines with the objective of minimizing some function of the completion times of the jobs, subject to the constraints that the sequence of machines for each job is prescribed; and each machine can process only one job at a time. The processing of a job on a machine is called an operation; its time is fixed, and it cannot be interrupted. There is chosen the objective of minimizing the makespan, the time needed for processing all jobs. |
« edellinen | seuraava »
SCIMA