Single Machine Batch Scheduling with Controllable Setup and Processing Times
Résumé
Two models of single machine batch scheduling problem are studied. In one model, each job ends at its completion time. In the second model, each job ends at the completion time of its group. Processing times and setup times can be compressed by using a continuously divisible resource. Several criteria are considered: total weighted resource consumption is minimized subject to meeting job deadlines or total weighted job completion time is minimized subject to given restriction on resource consumption.