Name
Title | ||
|---|---|---|
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan |
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 52 for the non-identical job size model will be derived. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.orl.2007.01.007 | Oper. Res. Lett. |
Keywords | Field | DocType |
bounded batching machine,release date,worst-case analysis,approximation algorithm,bounded single-machine,scheduling problem,batching,family,family job,worst-case ratio,polynomial-time approximation scheme,identical job size model,non-identical job size model,single-machine scheduling,polynomial time approximation scheme | Combinatorics,Laryngectomy,Neck dissection,Surgery,Mathematics | Journal |
Volume | Issue | ISSN |
36 | 1 | Operations Research Letters |
Citations | PageRank | References |
8 | 0.61 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Q. Q. Nong | 1 | 47 | 6.24 |
| C. T. Ng | 2 | 1058 | 54.64 |
| T.C. Edwin Cheng | 3 | 3906 | 256.62 |