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.
Original language | English |
---|---|
Pages (from-to) | 307-318 |
Number of pages | 12 |
Journal | Optimization Letters |
Volume | 8 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jan 2014 |
Keywords
- Batch processing
- Makespan
- Release dates
- Scheduling
ASJC Scopus subject areas
- Control and Optimization