|
|||||
|
|
A note on flow-shop and job-shop batch scheduling with identical processing-time jobs |
|
| Institution: | 1. Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Van Mourik Broekmanweg 6, XE Delft 2628, the Netherlands;2. College of Systems Engineering, National University of Defense Technology Changsha 410073, China;3. Department of Economics, Universidad Nacional del Sur, San Andrés 800, Bahía Blanca 8000, Argentina;4. IIESS UNS CONICET, San Andrés 800, Bahía Blanca 8000, Argentina |
| Abstract: | We address a batch scheduling problem of n identical processing time jobs on an m-machine flow-shop and a 2-machine job-shop. The objective is makespan minimization. Both problems are shown to be solved in O(n). |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |