Abstract
This chapter deals with the enhanced \(D^*\)-driven policy, which incorporates the \(D^*\)-driven policy into the enhanced schedule revision policy discussed in Chap. 3. We also examine the effectiveness of the enhanced \(D^*\)-driven policy, considering dynamic flexible flow shop problems with urgent jobs as interruptions. We first develop the basic idea and the framework of the enhanced \(D^*\)-driven policy, and then describe flexible flow shop scheduling problems with urgent jobs. Through a series of computational simulations, we investigate the performance of the enhanced \(D^*\)-driven policy by comparing it with various schedule revision policies to show the effectiveness of the enhanced \(D^*\)-driven policy.
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
References
Brah SA, Hunsucker JL (1991) Branch and bound algorithm for the flow shop with multiple processors. Eur J Oper Res 51:88–99
Krüger K, Sotskov YN, Werner F (1998) Heuristics for generalized shop scheduling problems based on decompositions. Int J Prod Res 36(11):3013–3033
Lee HF, Stecke KE (1998) Production planning for flexible flow systems with limited machine flexibility. IIE Trans 30:669–684
Ovacik IM, Uzsoy R (1997) Decomposition methods for complex factory scheduling problems. Kluwer Academic Publishers, Massachusetts
Pflughoeft KA, Hutchinson GK, Nazareth DL (1996) Intelligent decision support for flexible manufacturing: design and implementation of a knowledge-based simulator. Omega, Int J Manage Sci 24(3):347–360
Pinedo M (2008) Scheduling—theory, algorithms, and systems, 3rd edn. Springer, New York
Quadt D, Kuhn H (2007) A taxonomy of flexible flow line scheduling procedures. Eur J Oper Res 178:686–698
Sriskandarajah C, Sethi SP (1989) Scheduling algorithms for flexible flowshops: worst and average case performance. Eur J Oper Res 43:143–160
Suwa H, Sandoh H (2007) Capability of cumulative delay based reactive scheduling for job shops with machine breakdowns. Comput Ind Eng 53:63–78
Vieria GE, Herrmann JW, Lin E (2000) Predicting the performance of rescheduling strategies for parallel machine systems. J Manuf Syst 19(4):256–266
Wittrock RJ (1985) Scheduling algorithms for flexible flow lines. IBM J Res Dev 29(4):401–412
Wittrock RJ (1988) An adaptable scheduling algorithm for flexible flow lines. Oper Res 36(3):445–453
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Suwa, H., Sandoh, H. (2013). Enhanced \(D^{*}\)-Driven Policy. In: Online Scheduling in Manufacturing. Springer, London. https://doi.org/10.1007/978-1-4471-4561-5_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4561-5_8
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4560-8
Online ISBN: 978-1-4471-4561-5
eBook Packages: EngineeringEngineering (R0)