We consider a scheduling problem introduced by Ahmadi et al., Batching and scheduling jobs on batch and discrete processors, Operation Research 40 (1992) 750–763, in which each job has to be prepared before it can be processed. The preparation is performed by a batching machine; it can prepare at mostc jobs in each run, which takes an amount of time that is independent of the number and identity of the jobs under preparation. We present a very strong Lagrangian lower bound by using the new concept of positional completion times. This bound can be computed in O(n logn) time only, wheren is the number of jobs. We further present two classes of O(n logn) heuristics that transform an optimal schedule for the Lagrangian dual problem into a feasible schedule. Any heuristic in one class has performance guarantee of 3/2. We further show that even the most naive heuristic in this class has a compelling empirical performance. An earlier draft of this paper has appeared in the Proceedings of the Fourth International IPCO Conference, Lecture Notes in Computer Science, vol. 920, Springer, Berlin.

, , , , , ,
doi.org/10.1007/BF01585876, hdl.handle.net/1765/12338
ERIM Article Series (EAS)
Mathematical Programming
Erasmus Research Institute of Management

Hoogeveen, J.A, & van de Velde, S.L. (1998). Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine. Mathematical Programming, 273–289. doi:10.1007/BF01585876