haku: @indexterm Scheduling / yhteensä: 635
viite: 359 / 635
| Tekijä: | Panwalkar, S.S. |
| Otsikko: | Scheduling of a two-machine flowshop with travel time between machines |
| Lehti: | Journal of the Operational Research Society
1991 : JUL, VOL. 42:7, p. 609-613 |
| Asiasana: | SCHEDULING OPTIMIZATION |
| Kieli: | eng |
| Tiivistelmä: | The classical two-machine flowshop sequencing problem involving a single transporter and unlimited buffer space between machines is considered with the following additional constraint. When a job is completed on the first machine it must be transported to the second machine; a single transporter is available. A completed block on the first machine will block the machine if the transporter is in transit. A constructive algorithm to minimize makespan is presented along with the proof of optimality. |
SCIMA