|
|||||
|
|
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan |
|
| Authors: | Q.Q. Nong T.C.E. Cheng |
| Affiliation: | a Department of Mathematics, Ocean University of China, Qingdao, Shandong 266071, PR China b Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China |
| Abstract: | We consider the problem of scheduling family jobs with release dates on a bounded batching machine to minimize the makespan. A polynomial-time approximation scheme for the identical job size model and an approximation algorithm with a worst-case ratio of  for the non-identical job size model will be derived. |
| Keywords: | Single-machine scheduling Worst-case analysis Approximation algorithm Family Batching |
| 本文献已被 ScienceDirect 等数据库收录！ | |