haku: @indexterm Scheduling / yhteensä: 635
viite: 100 / 635
| Tekijä: | Drobouchevitch, I. Strusevich, V. |
| Otsikko: | Heuristics for the two-stage job shop scheduling problem with a bottleneck machine |
| Lehti: | European Journal of Operational Research
2000 : JUN 1, VOL. 123:2, p. 229-240 |
| Asiasana: | OPERATIONAL RESEARCH HEURISTIC METHODS SCHEDULING |
| Kieli: | eng |
| Tiivistelmä: | The paper considers the job shop scheduling problem to minimize the makespan. It is assumed that each job consists of at most two operations, one of which is to be processed on one of m more or equal to two machines, while the other operation must be performed on a single bottleneck machine, the same for all jobs. For this strongly NP-hard problem the authors present two heuristics with improved worst-case performance. One of them guarantees a worst-case performance ration of 3/2. |
SCIMA