Machine scheduling with earliness, tardiness and non-execution penalties

@article{Hassin2005MachineSW,
  title={Machine scheduling with earliness, tardiness and non-execution penalties},
  author={Refael Hassin and Mati Shani},
  journal={Computers & OR},
  year={2005},
  volume={32},
  pages={683-705}
}
The study of scheduling problems with earliness-tardiness (E/T) penalties is motivated by the just-in-time (JIT) philosophy, which supports the notion that earliness, as well as tardiness, should be discouraged. In this work, we consider several scheduling problems. We begin by generalizing a known polynomial time algorithm that calculates an optimal schedule for a given sequence of tasks, on a single machine, assuming that the tasks have distinct E/T penalty weights, distinct processing times… CONTINUE READING

Tables and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 24 CITATIONS

Minimizing earliness and tardiness costs in stochastic scheduling

  • European Journal of Operational Research
  • 2014
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Note on single machine scheduling problems with resource dependent release times

  • 2017 3rd International Conference on Information Management (ICIM)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Optimal restricted due date assignment in scheduling

  • European Journal of Operational Research
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 36 REFERENCES

A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights

CY Lee, JY Choi
  • Computers & Operations Research
  • 1995
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL