On-line scheduling with setup costs

@article{Gambosi2000OnlineSW,
  title={On-line scheduling with setup costs},
  author={Giorgio Gambosi and Gaia Nicosia},
  journal={Inf. Process. Lett.},
  year={2000},
  volume={73},
  pages={61-68}
}
This paper deals with an on-line scheduling problem where tasks belong to a given set of c task types and are to be assigned to one of the m machines in order to minimize the maximum completion time. If a task of a certain type is assigned to a machine that has just completed the execution of a task of the same type, then it can be processed immediately. Otherwise, there is a setup time associated with switching the machine to a different task type. A suitable version of the classical List… CONTINUE READING

Citations

Publications citing this paper.

A survey of scheduling problems with setup times or costs

VIEW 10 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.