Now showing items 1-3 of 3
Parallel dedicated machine scheduling with a single server: full precedence case
The motivation for this study was the observation of a practical scenario that involves scheduling of two parallel machines attended by a single setup crew so as to minimize the makespan. This problem is known in scheduling ...
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 ...
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 ...