Abstract
This chapter introduces the \(D^*\)-driven policy which was briefly described in the previous chapter, considering job shop environments with random machine breakdowns as disruptions. Disjunctive representations of job shop problems with random breakdowns are first discussed, and then the properties of the cumulative task delay are elaborately investigated through computational simulations. The applicability and the capability of the \(D^*\)-driven policy are also discussed.
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
Mehta SV, Uzsoy RM (1998) Predictable scheduling of a job shop subject to breakdowns. IEEE Trans Robotics Autom 14(3):365–378
Morton TE, Pentico DW (1993) Heuristic scheduling systems. Wiley, New York
Pinedo M (2008) Scheduling—theory, algorithms, and systems, 3rd edn. Springer, New York
Suwa H, Sandoh H (2003) Reactive scheduling based on control limit policy with delayed tasks measurement. Trans ISCIE 16(11):565–573
Suwa H, Sandoh H (2007) Capability of cumulative delay based reactive scheduling for job shops with machine breakdowns. Comput Ind Eng 53:63–78
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). \({\varvec{D}}^*\)-Driven Policy: Application to Job Shop Problems. In: Online Scheduling in Manufacturing. Springer, London. https://doi.org/10.1007/978-1-4471-4561-5_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4561-5_6
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4560-8
Online ISBN: 978-1-4471-4561-5
eBook Packages: EngineeringEngineering (R0)