Now showing items 1-5 of 5
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 ...
Scheduling with tool changes to minimize total completion time: a study of heuristics and their performance
(John Wiley & Sons, Inc., 2003)
The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a ...
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 ...
A new dominance rule to minimize total weighted tardiness with unequal release dates
We present a new dominance rule by considering the time-dependent orderings between each pair of jobs for the single machine total weighted tardiness problem with release dates. The proposed dominance rule provides a ...
Non-identical parallel CNC machine scheduling
(Taylor & Francis, 2003)
In this study, we solve the non-identical parallel CNC machine scheduling problem. We have two objectives: minimizing the manufacturing cost (comprising machining, non-machining and tooling costs) and minimizing the total ...