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 frac(5, 2) for the non-identical job size model will be derived.
Original language | English |
---|---|
Pages (from-to) | 61-66 |
Number of pages | 6 |
Journal | Operations Research Letters |
Volume | 36 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jan 2008 |
Keywords
- Approximation algorithm
- Batching
- Family
- Single-machine scheduling
- Worst-case analysis
ASJC Scopus subject areas
- Management Science and Operations Research
- Statistics, Probability and Uncertainty
- Discrete Mathematics and Combinatorics
- Modelling and Simulation