A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Flow Shop Scheduling
[chapter]
International Handbook on Information Systems
Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence. For convenience, let us assume that any two consecutive tasks of the same job are to be processed on different machines. The type of factory layout in the general case -handled in Chapter 10 -is the job shop; the particular case where each job is processed on a set of machines in the same order is the flow shop. The most
doi:10.1007/978-3-540-32220-7_8
fatcat:lpbh66dg6rchlabnmjhdp5wnli