ジョブショップ・スケジューリングにおける定期スケジュール修正時期の最適化に関する研究 [in Japanese] A Study on Optimal Timing of Periodic Schedule Revision in Jobshop Scheduling [in Japanese]
Access this Article
Search this Article
This paper proposes a mathematical model of an optimal periodic schedule revision policy for jobshop scheduling where we detect delays of tasks and perform a periodic schedule revision at <I>iT/M</I> (<I>i</I>= 1, 2, …, <I>M</I>) for a schedule period <I>T</I>. We first overview the jobshop scheduling and then investigate the property of schedule delays. The long-run average cost per unit time of the schedule revision policy is, secondly, formulated under the assumption that the number <I>N (t) </I> of delayed tasks occurring over (0, <I>t</I>] follows a non-homogeneous Poisson process with mean value function <I>H (t) </I>. It is shown that there always exists a finite frequency <I>M</I>* minimizing the long-run average cost. Through computational experiments, finally, we discuss the characteristics of the proposed policy and its applicability to jobshop scheduling problems.
- Transactions of the Institute of Systems, Control and Information Engineers
Transactions of the Institute of Systems, Control and Information Engineers 13(4), 204-211, 2000-04-15
THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)