7A1 REAL-TIME MACHINE SCHEDULING WITH VARIABLE DURATIONS(Technical session 7A: Machine and shop scheduling 2)

概要

論文の詳細を見る
A jobshop scheduling is to determine starting time and duration (if they are not fixed) for each task within a job (product) to minimize makespan or latest finishing time of the total jobs. There are two types of constraints involved in the problem: one is task sequence within each job, that is, task 2 can not start before task 1 has finished ; the other is a non-overtaking constraint on machine resources, that is, each machine can only process one task at a time. The second type of constraints is non-linear, which leads the problem too difficult to be solved optimally within a reasonable computing time. This study is motivated by wafer machine manufacturing. Both machine and wafers are very expensive. Each second of processing time is worth $100, thus optimal solution and quick computing time of scheduling is crucial for the automatic scheduling system of the machine. I convert those non-linear constraints into linear ones, and according to the special structure of the problem, an exact solution method has been developed to solve the problem optimally within 30 seconds.
一般社団法人日本機械学会の論文
2006-07-18