| L. Gelders and P.R. Kleindorfer. 1975. Co-ordinating Aggregate and Detailed Scheduling Decisions in the One Machine Job Shop: Part II Computation and Structure. Operations Research, 23, 312--324. |
....decisions. The former considers a one machine problem with given jobs which are never rejected. The criterion is a combination of overtime costs plus flow time and tardiness measures. The principal decision variable is the amount of overtime planned at the end of a regular time period. Also see Gelders and Kleindorfer (1975). Holloway and Nelson (1974) insert overtimes into the regular schedule to cut down tardiness. They also generate tardiness vs. overtime trade off curves. A variant of problems in category (ii) in the cyclic scheduling realm is studied by Loerch (1990) and Loerch and Muckstadt (1994) First, for ....
L. Gelders and P.R. Kleindorfer. 1975. Co-ordinating Aggregate and Detailed Scheduling Decisions in the One Machine Job Shop: Part II Computation and Structure. Operations Research, 23, 312--324.
....and delivery performance. He concludes that event driven algorithms, when due dates are specified internally, yield the best results. Problems of type (ii) combine short term capacity planning with scheduling. The easiest way of tweaking capacity in the short term is by using overtime. Both Gelders and Kleindorfer (1974) and Holloway and Nelson (1974) adopt this view and combine scheduling with overtime decisions. The former considers a one machine problem with given jobs which are never rejected. The criterion is a combination of overtime costs plus flow time and tardiness measures. The principal decision ....
L. Gelders and P.R. Kleindorfer. 1974. Co-ordinating Aggregate and Detailed Scheduling Decisions in the One Machine Job Shop: Part I Theory. Operations Research, 22, 46--60.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC