Now showing items 1-3 of 3
Satisfying due-dates in a job shop with sequence-dependent family set-ups
(Taylor & Francis, 2003)
This paper addresses job shop scheduling with sequence dependent family set-ups. Based on a simple, single-machine dynamic scheduling problem, state dependent scheduling rules for the single machine problem are developed ...
Minimizing Lmax for the single machine scheduling problem with family set-ups
(Taylor & Francis, 2004)
A procedure for the single machine-scheduling problem of minimizing the maximum lateness for jobs with sequence independent set-ups is presented. The procedure provides optimal/near-optimal solutions over a wide range of ...
Satisfying due-dates in the presence of sequence dependent family setups with a special comedown structure
This paper addresses a static, n-job, single-machine scheduling problem with sequence dependent family setups. The setup matrix follows a special structure where a constant setup is required only if a job from a smaller ...