Summary
In this paper, we develop efficient heuristic algorithms for multiprocessor task scheduling in a two-stage flow-shop environment to minimize makespan. We also derive a very effective lower bound for the problem. Then, we analyze the worst case error-bound of the heuristic algorithms. Next, we perform computational experiments to analyze the performance of the heuristic algorithms by computing the average percentage deviation of each heuristic solution from the lower bound. The results of the computational experiment on a set of randomly generated problems show that the proposed heuristic algorithms perform well. Furthermore, we consider the reverse problem and show that the two problems are equivalent. Finally, we identify a special case of the problem that is polynomially solvable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bianco L., Blazewicz J., Dell’Olmo P., and Drozdowski M. (1995), Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Ann. Opns Res., 58, 493–517.
Blazewicz J., Drabowski M., and Weglarz J. (1986), Scheduling multiprocessor tasks to minimize schedule length, IEEE Trans. Comput C-35/5 389–393.
Blazewicz J., Dell’Olmo P., Drozdowski M., and Speranza M.G. (1992), Scheduling multiprocessor tasks on three dedicated processors, Inform. Process. Lett., 41, 275–280.
Brucker P., and Kramer A. (1995), Shop scheduling problems with multiprocessor tasks on dedicated processors, Ann. Opns Res., 57, 13–27.
Brucker P., and Kramer A. (1996), Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems, Eurp. J. Opl Res., 90, 214–226.
Chen B. (1995), Analysis of classes of heuristics for scheduling two-stage flow shops with parallel machines at one stage, J. Opl Res. Soc., 46, 234–244.
Drozdowski M. (1996), Scheduling multiprocessor tasks — An overview, Eurp. J. Opl Res., 94, 215–230.
Du J., and Leung J.Y-T. (1989), Complexity of scheduling parallel task systems, SIAM J. Disc. Math., 2, 473–487.
Guinet A., Solomon M.M., Kedia P.K., and Dussauchoy A. (1996), A computational study of heuristics for two-stage flexible flowshops, Int. J. Prod. Res., 34, 1399–1415.
Gupta J.N.D. (1988), Two-stage, hybrid flowshop scheduling problem, J. Opl Res. Soc., 39, 359–364.
Gupta J.N.D., Hariri A.M.A., and Potts C.N. (1997), Scheduling a two-stage hybrid flow shop with parallel machines at the first stage, Ann. Opns Res., 69, 171–191.
Hoogeveen J.A., van de Velde S.L., and Veltman B. (1994), Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Disc. App. Math., 55, 259–272.
Hoogeveen J.A., Lenstra J.K., and Veltman B. (1996), Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard, Eurp. J. Opl Res., 89, 172–175.
Johnson S.M. (1954), Optimal two and three-stage production schedules with setup times included, Naval Res. Logist. Q., 1, 61–68.
Kubale M. (1987), The complexity of scheduling independent two-processor tasks on dedicated processors, Inform. Process. Lett., 24, 141–147.
Kubale M. (1996), Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors, Eurp. J. Opl Res., 94, 242–251.
Lee C.-Y., and Vairaktarakis G.L. (1994), Minimizing makespan in hybrid flowshops, Opns Res. Lett, 16, 149–158.
Lloyd E.L. (1981), Concurrent task systems, Opns Res., 29, 189–201.
Oğuz C., Ercan M.F., Cheng T.C.E., and Fung Y.F. (1998), Multiprocessor task scheduling in two-stage flow-shops, submitted for publication.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oğuz, C., Qi, X.T., Fung, Y.F. (1999). Two-Stage Flow-Shop Scheduling Problem with Multiprocessor Tasks at the First Stage. In: Kall, P., Lüthi, HJ. (eds) Operations Research Proceedings 1998. Operations Research Proceedings 1998, vol 1998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58409-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-58409-1_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65381-3
Online ISBN: 978-3-642-58409-1
eBook Packages: Springer Book Archive