병렬기계로 구성된 인쇄회로기판 제조공정에서의 스케쥴링에 관한 연구
Unrelated Parallel Machine Scheduling for PCB Manufacturing
0
조회
0
다운로드
1
인용
0
참고문헌
초록
Abstract
This research considers the problem of scheduling jobs on unrelated parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact that a certain phase of printed circuit board manufacturing and other production systems is bottleneck and the processing speeds of parallel machines in this phase are different for each job. A zero-one integer programming formulation is presented and two dominance properties are proved. By these dominance properties, it is shown that the problem is reduced to asymmetric assignment problem and is solvable in polynomial time.
참고문헌 (9)
- "Introduction to Sequencing and Scheduling" (1974), John Wiley
- "Sequencing with Earliness and Tardiness Penalties", pp.22~36 (1990)
- "Algorithms and Codes. MIT Press"
- "Minimizing the Average Deviation of Job Completion Times about a Common Due Date", pp.643~651 (1981)
- "The Hungarian Method for the Assignment Problem", pp.83~97 (1955)
- "Exact and approximation algorithms for makespan minimization on unrelated parallel machines", 75, pp.169~188 (1977)
- "Duality based relaxations for makespan minimization for unrelated parallel machines", pp.21~ (1991)
- "A local search heuristics for unrelated parallel machine scheduling with efficient neighborhood search", 24(9), pp.11~19 (1996)
- "Scheduling of unrelated parallel machines an application to PWB manufacturing", pp.921~931 (2002), IIE Transactions