A survey of results for sequencing problems with controllable processing times
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Mathematics of Operations Research
Batch sizing and job sequencing on a single machine
Annals of Operations Research
Computers and Operations Research
Single machine batch scheduling with deadlines and resource dependent processing times
Operations Research Letters
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Optimal due date assignment and resource allocation in a group technology scheduling environment
Computers and Operations Research
Hi-index | 0.00 |
In this paper we study the single-machine batch scheduling problem under batch availability, where both setup and job processing times are controllable by allocating a continuously divisible nonrenewable resource. Under batch availability a set of jobs is processed contiguously and completed together, when the processing of the last job in the batch is finished. We present polynomial time algorithms to find the job sequence, the partition of the job sequence into batches and the resource allocation, which minimize the total completion time or the total production cost (inventory plus resource costs).