Abstract
In this paper we address the problem of scheduling unit time jobs in a flowshop to minimize makespan under a discrete renewable resource constraint. We propose algorithms having complexityO(n) for special cases of two machine and three machine problems. For the three machineN P-hard problem we develop a branch and bound procedure and several upper and lower bounds. We test the efficiency of the procedure and report our computational experience.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baker KR (1974)Introduction to Sequencing and Scheduling. J. Wiley and Sons, New York
Blazewicz J (1987) Selected Topics in Scheduling Theory.Annals of Discrete Mathematics 31: 1–60
Blazewicz J, Kubiak W and Szwarcfiter J (1988) Scheduling Unit-Time Tasks on Flow-Shops Under Resource Constraints.Annals of Operations Research 16:255–266
Blazewicz J, Lenstra JK and Rinnooy Kan AHG (1983) Scheduling Subject to Resource Constraints: Classification and Complexity.Discrete Applied Mathematics 5:11–22
Blazewicz J, Cellary W, Slowinski R and Weglarz J (1986)Scheduling Under Resource Constraints:Deterministic Models, JC Baltzer, Basel
Garey MR, Graham RL and Johnson DS (1976) Resource Constrained Scheduling as Generalized Bin Packing.Journal of Combinatorial Theory (A) 21:257–298
Ibaraki T (1982) The Power of Upper and Lower Bounding Functions in Branch- and-bound Algorithms.Journal of Operations Research Society of Japan 25:292–320
Krause KL, Shen VY and Schwetman HD (1975) Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems.Journal of Association for Computing Machinery 22, No. 4:522–550
Lawler IL, Lenstra JK and Rinnooy Kan AHG (1982) Recent Developments in Deterministic Sequencing and Scheduling: A Survey. In MAH Demster, JK Lenstra and AHG Rinnooy Kan, eds.,Deterministic and Stochastic Scheduling, Reidel, Dordrecht, pp. 35–73
Lenstra JK and Rinnooy Kan AHG (1984) New Directions in Scheduling Theory.Operations Research Letters 2, No. 6:255–259
Röck H (1984) Some New Results in No-wait Flow Shop Scheduling.Zeitschrift for Operations Research 28:1–16
Slowinski R (1980) Two Approaches to Problems of Resource Allocation among Project Activities -A Comparative Study.Journal of Operational Research Society 31:711–723
Slowinski R (1984) Preemptive Scheduling of Independent Jobs on Parallel Machines Subject to Financial Constraints.European Journal of Operational Research 15:366–373
Yao AC (1975) Scheduling Unit-time Tasks with Limited Resources. In G Goos and J Hartmanis, eds.,Lecture Notes in Computer Science, Springer-Verlag, Berlin 24:17–36
Author information
Authors and Affiliations
Additional information
Suna Kondakci was a visiting assistant professor at the Industrial Engineering Department, Purdue University, when the paper was revised.
Rights and permissions
About this article
Cite this article
Süral, H., Kondakci, S. & Erkip, N. Scheduling unit-time tasks in renewable resource constrained flowshops. ZOR - Methods and Models of Operations Research 36, 497–516 (1992). https://doi.org/10.1007/BF01416242
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01416242