Minimizing due date related performance measures on two batch processing machines |
| |
| Institution: | 1. IMDEA Networks Institute, Av. del Mar Mediterráneo 22, 28918 Leganés, Madrid, Spain;2. University of Cyprus, Department of Computer Science, 75 Kallipoleos Str., P.O. Box 20537, 1678 Nicosia, Cyprus;3. University of Liverpool, Department of Computer Science, Ashton Building, Ashton Street, Liverpool L69 3BX, United Kingdom;4. University Carlos III of Madrid, Department of Telematics Engineering, Torres Quevedo Building, Av. Universidad 30, 28911 Leganés, Madrid, Spain |
| |
| Abstract: | This paper considers a scheduling problem in a two-machine flowshop of two batch processing machines. On each batch processing machine, jobs are processed in a batch, and each batch is allowed to contain jobs up to the maximum capacity of the associated machine. The scheduling problem is analyzed with respect to three due date related objectives including maximum tardiness, number of tardy jobs and total tardiness. In the analysis, several solution properties are characterized and based upon these properties, three efficient polynomial time algorithms are developed for minimizing the due date related measures. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
