haku: @author Uzsoy, R. / yhteensä: 5
viite: 4 / 5
Tekijä:Chandru, V.
Lee, C.Y.
Uzsoy, R.
Otsikko:Minimizing total completion time on batch processing machines. (Durchlaufplanung, Durchlaufzeit, Heuristische Methode)
Lehti:International Journal of Production Research
1993 : VOL. 31:9, p. 2097-2121
Asiasana:
Vapaa asiasana:FERTIGUNGSSTEUERUNG, SERIENFERTIGUNG
Kieli:eng
Tiivistelmä:This article studies the problem of minimizing total completion on single and parallel batch processing machines. The processing time of a batch is equal to the largest processing time among all jobs in the batch. The authors provide an exact solution procedure for the single machine problem and heuristic algorithms for both single and parallel machine problems. While the exact algorithms have limited applicability due to high computational requirements, extensive experiments show that the heuristics are capable of consistently obtaining near optimal solutions.
SCIMA tietueen numero: 120946
lisää koriin
SCIMA