×
Szwarc, W.; Liu, J. J.

An approximate solution of the flow-shop problem with sequence dependent setup times. (English) Zbl 0692.90060

Z. Oper. Res. 33, No. 6, 439-451 (1989).
The m-machine flow shop problem with sequence dependent setup times is considered. To solve the problem a related model is investigated where the setup times are defined in an additive way. The approximate solutions obtained by the additive model are compared with the optimal solutions for cases with machines and jobs both less or equal to 8. Computational results show that the method performs very well for the two machine case and for relatively small setup times.
Reviewer: H.Kellerer

MSC:

90B35 Deterministic scheduling theory in operations research
65K05 Numerical mathematical programming methods

Keywords:

m-machine flow shop; sequence dependent setup times; approximate solutions; Computational results
Cite Review PDF
Full Text: DOI

References:

[1] Gupta JND, Darrow WP (1985) Approximate schedules for the two-machine flowshop with sequence dependent setup times. Indian Journal of Management and Systems 1:6-11
[2] Gupta JND, Darrow WP (1986) The two-machine sequence dependent flowshop scheduling problem. European Journal of Operational Research 24:439-446 · Zbl 0601.90075 · doi:10.1016/0377-2217(86)90037-8
[3] Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1:61-68 · Zbl 1349.90359 · doi:10.1002/nav.3800010110
[4] Srikar BN, Ghosh S (1986) An MILP model for the n-job, m-stage flowshop with sequence dependent setup times. International Journal of Production Research 24:1459-1474 · Zbl 0605.90066 · doi:10.1080/00207548608919815
[5] Sule DR (1982) Sequencingn jobs on two machines with setup, processing and removal times separated. Naval Research Logistics Quarterly 29:517-519 · Zbl 0511.90073 · doi:10.1002/nav.3800290313
[6] Szwarc W (1983) The flow shop problem with time lags. Management Science 29:477-481 · Zbl 0513.90036 · doi:10.1287/mnsc.29.4.477
[7] Szwarc W, Gupta JND (1987) A flow-shop problem with sequence dependent additive setup times. Naval Research Logistics Quarterly 34:619-627 · Zbl 0657.90046 · doi:10.1002/1520-6750(198710)34:5<619::AID-NAV3220340503>3.0.CO;2-B
[8] Uskup G, Spencer SB (1975) A branch and bound algorithm for the two-stage production-sequencing problems. Operations Research 23:118-136 · Zbl 0326.90031 · doi:10.1287/opre.23.1.118
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.