Abstract
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore, the tasks in each job are subject to precedence constraints. A schedule is, then, an arrangement of all tasks on the machines that satisfies the precedence constraints. Usually the number of constraints is very large, which makes JSP one of the hardest combinatorial problems (an NP-complete problems, [99] and [57]. The flow shop problem (FSP), a much restricted version of JSP, can be reduced to the traveling salesman problem (TSP) [137].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ansari, N., Hou, E. (1997). Job Shop Scheduling. In: Computational Intelligence for Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6331-0_11
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6331-0_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7907-2
Online ISBN: 978-1-4615-6331-0
eBook Packages: Springer Book Archive