《Job Shop Scheduling》.pdfVIP

Chapter 7: Job-shop scheduling (pp. 134–160) Genetic algorithms in engineering systems Edited by A.M.S. Zalzala and P.J. Fleming IEE control engineering series 55 c 1997: The Institution of Electrical Engineers, ISBN: 0 85296 902 3 Chapter 7 Job-shop scheduling Takeshi Yamada and Ryohei Nakano 7.1 Introduction Scheduling is the allocation of shared resources over time to competing activities. It has been the subject of a significant amount of literature in the operations research field. Emphasis has been on investigating machine scheduling problems wherejobs represent activities and machines represent resources; each machine can process at most one job at a time. Table 7.1: A problem job Operations routing (processing time) 1 1 (3) 2 (3) 3 (3) 2 1 (2) 3 (3) 2 (4) 3 2 (3) 1 (2) 3 (1) The minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of jobs which is to be processed on a set of machines . Each job has a technological sequence of machines to be processed. The processing of job on machine is called the operation . Operation requires the exclusive use of for an uninterrupted duration , its processing time. A schedule is a set of completion times for each operation that satisfies those constraints. The time required to complete all the jobs is called the makespan . The objective when solving or optimizing this general problem is to determine the schedule which min- imizes . An example of a JSSP is given in Table 7.1. The data includ