Abstract
We consider a manufacturing system producing a variety of products in demand using machines in a general network configuration, which generalizes both the parallel and the tandem machine models. Each product follows a given process plan or recipe that specifies the sequence of machines it must visit and the operations performed by them. A recipe may call for multiple visits to a given machine, as is the case in semiconductor manufacturing (Lou and Kager [125], Srivatsan, Bai, and Gershwin [186], and Uzsoy, Lee, and Martin-Vega [195, 196]). Often the machines are unreliable. Over time they break down and must be repaired. A manufacturing system so described will be termed a dynamic jobshop. The term will be made mathematically precise in the next section.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sethi, S.P., Zhang, Q. (1994). Hierarchical controls in dynamic jobshops. In: Hierarchical Decision Making in Stochastic Manufacturing Systems. Systems & Control: Foundations & Applications. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0285-1_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0285-1_7
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6694-5
Online ISBN: 978-1-4612-0285-1
eBook Packages: Springer Book Archive