Job Shops (Deterministic)

Michael L. Pinedo ()
Additional contact information
Michael L. Pinedo: New York University

Chapter Chapter 7 in Scheduling, 2012, pp 183-220 from Springer

Abstract: Abstract This chapter deals with multi operation models that are different from the flow shop models discussed in the previous chapter. In a flow shop model all jobs follow the same route. When the routes are fixed, but not necessarily the same for each job, the model is called a job shop. If a job in a job shop has to visit certain machines more than once, the job is said to recirculate. Recirculation is a common phenomenon in the real world. For example, in semiconductor manufacturing jobs have to recirculate several times before they complete all their processing.

Keywords: Constraint Programming; Precedence Constraint; Longe Path; Total Weighted Tardiness; Disjunctive Programming (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-2361-4_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461423614

DOI: 10.1007/978-1-4614-2361-4_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().