清华大学-生产计划与控制：PPC-L12-Scheduling-B.pdfVIP

Ye ChengYe Cheng Dept. of Industrial EngineeringDept. of Industrial Engineering Tsinghua UniversityTsinghua University 1 Sequencing Algorithms for Multiple Machines Example Permutation schedule Total flow time Mean flow time Mean idle time Ye Cheng, Dept. IE, Tsinghua University                      Production Planning  Control                    Lecture 12   Operations Scheduling (2) 2 Scheduling n Jobs on 2 Machines Each job must be processed in the order machine 1 then machine 2 Optimization criterion: minimize the makespan Theorem: The optimal solution for scheduling n jobs on two machines is always a permutation schedule Ye Cheng, Dept. IE, Tsinghua University                      Production Planning  Control                    Lecture 12   Operations Scheduling (2) 3 Johnson’s Rule (1/2) Notation Machines: A and B Jobs are labeled i, for 1 ≤i ≤n Define processing times Ai = Processing time of job i on machine A Bi = Processing time of job i on machine B Rule: Job i precedes job (i + 1) if min(A , B ) min(A , B ) i i +1 i +1 i Ye Cheng, Dept. IE, Tsinghua University                      Production Planning  Control                    Lecture 12   Operations Scheduling (2) 4 Johnson’s Rule (2/2) An easy way for implementation List the values of Ai and Bi in two columns Find the smallest rem