Abstract
Flow shop is a common manufacturing environment for the production of multiple types of similar products. A permutation flow shop is a special kind of flow shop where processing sequences at all production stages are physically constrained to be the same. These "identical sequence constraints" couple the processing sequences of various production stages, making it difficult to have a separable problem formulation which is critical for obtaining near-optimal schedules by using the Lagrangian relaxation technique. This paper presents a novel "separable" integer programming formulation for permutation flow shops. The objective is to minimize penalties on production tardiness and on releasing raw materials too early subject to relevant constraints. After coupling constraints are relaxed by using Lagrange multipliers, the problem is decomposed into individual subproblems that can be solved without much enumeration. The multipliers are updated at the high level by using the recently developed Reduced Complexity Bundle Method. The "inherent duality gap" is proved to exist in general, implying that the quality of a schedule generated may be higher than what is indicated by its relative duality gap. Testing results show that the algorithm can be effectively used to solve practical scheduling problems.
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, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
K.R. Baker, A comparative survey of flowshop algorithms, Operations Research 23(1975)62–73.
H.G. Campbell, R.A. Dudek and M.L. Smith, A heuristic algorithm for the n job m machine sequencing problem, Management Science 16(1970)630–637.
S.C. Chang and D.Y. Liao, Scheduling flexible flow shops with no setup effects, IEEE Trans. Robotics and Automation 10(1994)112–122.
C.S. Czerwinski and P.B. Luh, Scheduling products with bills of materials using an improved Lagrangian relaxation technique, IEEE Trans. Robotics and Automation 10(1994)99–111.
R.L. Daniels and J.B. Mazzola, Flow shop scheduling with resource flexibility, Operations Research 42(1994)504–522.
R.A. Dudek, S.S. Panwalkar and M.L. Smith, The lessons of flowshop scheduling research, Operations Research 40(1992)7–13.
A.M. Frieze and J. Yadegar, A new integer programming formulation for the permutation flowshop problem, European Journal of Operational Research 40(1989)90–98.
T. Gonzalez and S. Sahni, Flowshop and jobshop schedules: Complexity and approximation, Operations Research 26(1978)36–52.
J.N.D. Gupta, Heuristic algorithms for multistage flow shop problem, AIIE Transactions 4(1972) 11–18.
J. Han and S. Hou, The relation between Lagrangian relaxation and linear programming relation for job shop scheduling, Technical Report No. 042, Institute of Applied Mathematics, Academia Sinica, Beijing, China, 1994.
M. Held and R.M. Karp, A dynamic programming approach to sequencing problems, J. Soc. Indust. Appl. Math. 10(1962)196–210.
J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms II, Springer, Berlin, 1993.
B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan, A general bounding scheme for the permutation flowshop problem, Operations Research 26(1978)53–67.
P.B. Luh and D.J. Hoitomt, Scheduling of manufacturing systems using the Lagrangian relaxation technique, IEEE Transactions on Automatic Control 38(1993)1066–1080.
B.L. MacCarthy and J. Liu, Addressing the gap in scheduling research: A review of optimization and heuristic methods in production scheduling, Int. J. Prod. Res. 31(1993)59–79.
G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
M. Pinedo, Scheduling Theory, Algorithms, and Systems, Prentice-Hall, 1995.
N.Z. Shor, Minimization Methods for Non-Differentiable Functions, Springer, 1985.
R.N. Tomastik, private communication, 1994.
R.N. Tomastik and P.B. Luh, The facet ascending algorithm for integer programming problems, Proc. IEEE Conf. on Decision and Control, San Antonio, TX, Dec. 1993, pp. 2880–2884.
R.N. Tomastik and P.B. Luh, A Reduced Complexity Bundle method for maximizing concave nonsmooth functions, submitted, 1995.
M. Widmer and A. Hertz, A new heuristic method for the flowshop sequencing problem, European Journal of Operational Research 41(1989)186–193.
Rights and permissions
About this article
Cite this article
Liu, G., Luh, P.B. & Resch, R. Scheduling permutation flow shops using the Lagrangian relaxation technique. Annals of Operations Research 70, 171–189 (1997). https://doi.org/10.1023/A:1018970020599
Issue Date:
DOI: https://doi.org/10.1023/A:1018970020599