Abstract
The following problem is studied in this chapter. Given axe n jobs, which have to be processed on a single machine within a fixed timespan {1, 2, ..., T}. The processing time, or length, of each job equals p, p ∈ IN. The processing cost of each job is an arbitrary function of its start-time: we denote by c jt the cost of starting job j at time t. The problem is to schedule all jobs so as minimize the sum of the processing costs. We refer to this problem as problem SEL (Scheduling jobs of Equal Length).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Crama, Y., Oerlemans, A.G., Spieksma, F.C.R. (1994). Scheduling jobs of equal length: complexity and facets. In: Production Planning in Automated Manufacturing. Lecture Notes in Economics and Mathematical Systems, vol 414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-00459-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-00459-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58082-9
Online ISBN: 978-3-662-00459-3
eBook Packages: Springer Book Archive