Scheduling by positional completion times: analysis of a two-stage flow shop problem with a batching machine

J.A. Hoogeveen, S.L. Velde, van de

Research output: Contribution to journalArticleAcademicpeer-review

19 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)273-289
Number of pages17
JournalMathematical Programming
Volume82
Issue number1-2
DOIs
Publication statusPublished - 1998

Fingerprint Dive into the research topics of 'Scheduling by positional completion times: analysis of a two-stage flow shop problem with a batching machine'. Together they form a unique fingerprint.

Cite this