Abstract
Single machine scheduling problems with job release dates and technological precedence constraints among jobs are considered. It is assumed that job release dates depend on continuously-divisible resources such as: energy, fuel, catalyzer, row materials, financial outlay. The following optimization criteria are considered: makespan, total resource consumption and both simultaneously. Detailed computational complexity analysis of the considered problems and their special cases were conducted. It appears that some problems are NP-complete even for the some models of release dates for all jobs. Several special cases with polynomial time algorithms are found.
This work was supported by KBN Grant No 8T 11 F 001 11.
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.
References
J. Blazewicz, K. Ecker, G. Schmidt, J. Weglarz, “Scheduling in Computer and Manufacturing Systems”, Springer-Verlag, Berlin - Heidelberg, 1993.
S. French, “Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop”, Harwood, Chichester, 1982.
A. Janiak and J. Grabowski, “Optimization of the operation sequence with distribution of resource in discrete production systems”, Works of the Polish Academy of Science (System Research Institute), vol. 59, 1980, pp. 129–138 (in Russian).
A. Janiak, “Time-optimal control in a single machine problem with resource constraints”, Automatica 22, 1986, pp. 745–747.
A. Janiak, “Single machine scheduling problem with a common deadline and resource dependent release dates”, EJOR, 53, 1991, pp. 317–325.
A. Janiak, “Exact and Approximate Algorithms of Job Sequencing and Resource Allocation in Discrete Manufacturing Processes”, Monograph published by Technical University of Wroclaw, No 87/20, 1991 (in Polish).
J. Weglarz, “Multiprocessor scheduling with memory allocation - a deterministic approach. IEEE Trans. Comput., vol. C-29, No 8, 1980, pp. 703–709.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janiak, A. (1997). Computational Complexity Analysis of Single Machine Scheduling Problems with Job Release Dates Dependent on Resources. In: Operations Research Proceedings 1996. Operations Research Proceedings, vol 1996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60744-8_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-60744-8_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62630-5
Online ISBN: 978-3-642-60744-8
eBook Packages: Springer Book Archive