Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines

Dominik Kress (), Maksim Barketau () and Erwin Pesch ()
Additional contact information
Dominik Kress: University of Siegen
Maksim Barketau: National Academy of Sciences of Belarus
Erwin Pesch: University of Siegen

Journal of Scheduling, 2018, vol. 21, issue 6, No 4, 595-606

Abstract: Abstract We address the single-machine batch scheduling problem with the objective of minimizing the total setup cost. This problem arises when there are n jobs that are partitioned into F families and when setup operations are required whenever the machine switches from processing a job of one family to processing a job of another family. We assume that setups do not require time but are associated with a fixed cost which is identical for all setup operations. Each job has a processing time and an associated deadline. The objective is to schedule all jobs such that they are on time with respect to their deadlines and the total setup cost is minimized. We show that the decision version of this problem is NP-complete in the strong sense. Furthermore, we present properties of optimal solutions and an $$O(n\log n+nF)$$ O ( n log n + n F ) algorithm that approximates the cost of an optimal schedule by a factor of F. The algorithm is analyzed in computational tests.

Keywords: Batch scheduling; Job families; Setup cost; Strong NP-hardness; Approximation algorithm; EDD-schedule; GT-schedule (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-018-0561-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jsched:v:21:y:2018:i:6:d:10.1007_s10951-018-0561-5

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

DOI: 10.1007/s10951-018-0561-5

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

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