Now showing items 1-3 of 3
Scheduling with tool changes to minimize total completion time: basic results and SPT performance
We consider a single machine sequencing problem subject to tool wear, where the objective is to minimize the total completion time. We briefly describe the problem and discuss its properties, complexity and solution. ...
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 ...
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 ...