Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan |
| |
| Authors: | L L Liu C T Ng T C E Cheng |
| |
| Institution: | 1. School of Science, Shanghai Second Polytechnic University, No. 2360 Jinhai Road, Pudong Shanghai, 201209, China
2. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University Hung Hom, Kowloon, Hong Kong
|
| |
| Abstract: | Batch processing happens in many different industries, in which a number of jobs are processed simultaneously as a batch. In this paper we develop two heuristics for the problem of scheduling jobs with release dates on parallel batch processing machines to minimize the makespan and analyze their worst-case performance ratios. We also present a polynomial-time optimal algorithm for a special case of the problem where the jobs have equal processing times. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
