Abstract
The paper is an extension of the classical permutation flow-shop scheduling problem to the case where some of the job operation processing times are convex decreasing functions of the amounts of resources (e.g., financial outlay, energy, raw material) allocated to the operations (or machines on which they are performed). Some precedence constraints among the jobs are given. For this extended permutation flow-shop problem, the objective is to find a processing order of the jobs (which will be the same on each machine) and an allocation of a constrained resource so as to minimize the duration required to complete all jobs (i.e., the makespan). A computational complexity analysis of the problem shows that the problem is NP-hard. An analysis of the structure of the optimal solutions provides some elimination properties, which are exploited in a branch-and-bound solution scheme. Three approximate algorithms, together with the results of some computational experiments conducted to test the effectiveness of the algorithms, are also presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K.R. Baker, A comparative study of flow-shop algorithms, Opns. Res. 23(62) (1975).
J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt and J. Weglarz, Scheduling Computer and Manufacturing Processes(Springer, 1996).
H.G. Campbell, R.A. Dudek and M.L. Smith, A heuristic algorithm for the n job, m machine sequencing problem, Mgmt. Sci. 16 (1970) B6 30–B6 37.
D.G. Dannenbring, An evaluation of flow-shop sequencing heuristics, Mgmt. Sci. 23 (1977) 1174–1182.
M.R. Garey, D.S. Johnson and R. Sethi, The complexity of flow-shop and job-shop scheduling, Math. Oper. Res. 1 (1976) 117–129.
J. Grabowski and A. Janiak, Job-shop scheduling with resource-time models of operations, Europ. J. Oper. Res. 28 (1987) 58–73.
J. Grabowski, E. Skubalska and C. Smutnicki, On flow shop scheduling with release and due dates to minimize maximum lateness, J. Opl. Res. Soc. 34 (1983) 615.
H.W. Hamacher and S. Tufekci, Algebraic flows and time-cost tradeoff problems, Annals of Discrete Math. 19 (1984) 165–182.
A. Janiak, Time-optimal control in a single machine scheduling problem with resource constraints, Automatica 22 (1986) 745–747.
A. Janiak, One-machine scheduling problems with resource constraints, in: Lecture Notes in Control and Information Sciences, Vol. 84 (Springer, 1986) pp. 358–364.
A. Janiak, Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem, Informat. Proces. Letters 32 (1989) 101–112.
A. Janiak, Minimization of the makespan in a two-machine problem under given resource constraints, Europ. J. Oper. Res. (1998, to appear).
S.M. Johnson, Optimal two-and three-stage production schedules with setup times included, Naval Res. Logist. Quart. 1 (1954) 61–68.
B.J. Lagewag, J.K. Lenstra and A.H.G. Rinnooy Kan, A general bounding scheme for the permutation flow-shop problem, Oper. Res. 26 (1978) 52.
J.F. Muth and G.L. Thompson, eds., Industrial Scheduling(Prentice Hall, Englewood Cliffs, 1963) p. 236.
M. Nawaz, E.E. Enscore, Jr. and I. Ham, A heuristic algorithm for the m-machine n-job flow-shop sequencing problem, OMEGA 11 (1983) 91–95.
E. Polak, Optimization, Algorithms and Consistent Approximation(Springer, New York, 1997).
S. Turner and D. Booth, Comparision of heuristic for flow shop sequencing, OMEGA 15 (1987) 75–78.
T.J. Williams, ed., Analysis and Design of Hierarchical Control Systems: with Special Reference to Steel Plant Operations(North-Holland, 1986).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cheng, T., Janiak, A. A permutation flow-shop scheduling problem with convex models of operation processing times. Annals of Operations Research 96, 39–60 (2000). https://doi.org/10.1023/A:1018943300630
Issue Date:
DOI: https://doi.org/10.1023/A:1018943300630