Batch scheduling with deadlines on parallel machines

Peter Brucker, Mikhail Kovalyov, Yakov Shafransky and Frank Werner

Annals of Operations Research, 1998, vol. 83, issue 0, 23-40

Abstract: The problem of scheduling G groups of jobs on m parallel machines is considered. Each group consists of several identical jobs. We have to find splittings of groups into batches (i.e. sets of jobs to be processed contiguously) and to schedule the batches on the machines. It is possible for different batches of the same group to be processed concurrently on different machines. However, at any time, a batch can be processed on at most one machine. A sequence-independent machine set-up time is required immediately before a batch of a group is processed. A deadline is associated with each group. The objective is to find a schedule which is feasible with respect to deadlines. The problem is shown to be NP-hard even for the case of two identical machines, unit processing times, unit set-up times and a common deadline. It is strongly NP-hard if machines are uniform, the number of jobs in each group is equal and processing times, set-up times and deadlines are unit. Special cases which are polynomially solvable are discussed. For the general problem, a family {DP ɛ } of approximation algorithms is constructed. A new dynamic rounding technique is used to develop DP ɛ . For any ɛ > 0, DP ɛ delivers a schedule in which the completion time of each group is at most (1 + ɛ) times the value of its deadline if there exists a schedule which is feasible with respect to the deadlines. The time complexity of DP ɛ is O(G 2m+1 /ɛ 2m ). Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018912114491 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:83:y:1998:i:0:p:23-40:10.1023/a:1018912114491

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018912114491

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().