Abstract
We consider the general problem of static scheduling of a set of jobs in a network flow shop. In network flow shops, the scheduler not only has to sequence and schedule but also must concurrently determine the process routing of the jobs through the shop. In this paper, we establish the computational complexity of this new class of scheduling problem and propose a general purpose heuristic procedure. The performance of the heuristic is analyzed when makespan, cycle time and average flow time are the desired objectives.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Barany, “A vector-sum theorem and its applications to improving flow shop guarantees”, Math. of Opns. Res., Vol. 6, No.3, 1981.
T. Fiala, “An algorithm for the open-shop problem”, Math. of Opns. Res., Vol. 8, No. 1, 1983.
T. Gonzalez and S. Sahni, “Flowshop and jobshop schedules: Complexity and approximation”, Opns. Res. 26(11), 36–52 (1978).
S.C. Graves, H.C. Meal, D. Stefek, and A.H. Zeghmi, “Scheduling of re-entrant flow shops”, J. of Opns. Management, 3(4), (1983).
R.L. Graham, “Bounds for certain multiprocessing anomalies”, Bell System Tech. J. 45, 1563–1581, (1966).
H. Kamoun and C. Sriskandarajah, “The complexity of jobs in repetitive manufacturing systems”, Eur. J. of Opns. Res., 70, 350–364(1993).
E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, “Recent developments in deterministic sequencing and scheduling: A survey”, in: M.A.H. Dempster et al. (eds.), Deterministic and Stochastic scheduling, D. Reidel Publishing Co. Boston, MA, 35–73, (1982).
H. Matsuo, “Cyclic sequencing problems in the two-machine permutation flowshop: Complexity, worst-case and average-case analysis”, Naval Res. Log. 37, 679–694(1990).
S.T. McCormick, M.L. Pinedo, S. Shenker, and B. Wolf, “Sequencing in an assembly line with blocking to minimize cycle time”, Opns. Res. 37(6), 925–935(1989).
Nowicki, E., and Zdrzalka, S., “A survey of results for sequencing problems with controlable processing times”, Disc. Applied Math., 26, 271–287, 1990.
Nowicki, E., and Smutnicki, C., “Worst-case analysis of an approximation algorithm for flowshop sequencing problem”, Opns. Res., 8, 171–177, 1989.
P.S. Ow, “Focused scheduling in proportionate flowshops”, Management Sci. 31(7), 852–869, (1985).
P. Raghvan, “Probabilistic construction of deterministic algorithms: approximating packing integer programs”, J. of Comp. and Sys. Sci., 37, 130–143, 1988.
P. Raghvan and Thompson, C.D., “Provably good routing in graphs: regular arrays”, Proc. of 17th Annual ACM Symp. on Theory of Computing, 79–87, 1985.
R. Roundy, “Cyclic schedules for job shops with identical jobs”, Math. of Opns. Res. 17(4), 842–865(1992).
C. Sriskandarajah and S.P. Sethi, “Scheduling algorithms for flexible flowshops: worst case and average case performance”, Eur. J. of Opns. Res. 43, 143–160 (1989).
Sevastyanov, S.V., “Bounding algorithm for the routing problems with arbitrary paths and alternative servers”, Kibernetika, 22 (6), 74–79, 1986.
Sevastyanove, S.V., “Efficient construction of schedules close to optimal for the cases of arbitrary and alternative routes of parts”, Soviet Math. Kokl. 29(3), 447–450, 1984.
D. B. Shmoys, C. Stein, and J. Wein, “Improved approximation algorithm for shop scheduling problems”, SIAM Jour. on Comp., Vol. 23, pp 617–632, 1994.
R.J. Wittrock, “Scheduling algorithms for flexible flow line”, IBM J. Res. Develop. Vol. 29, No. 401–412, July (1985).
Author information
Authors and Affiliations
Additional information
This research has been supported by the UCLA Academic Senate Grant #95.
Rights and permissions
About this article
Cite this article
Ahmadi, R.H. Scheduling in network flow shops. J Glob Optim 9, 293–320 (1996). https://doi.org/10.1007/BF00121676
Issue Date:
DOI: https://doi.org/10.1007/BF00121676