Note on scheduling with general learning curves to minimize the number of tardy jobs

@article{Mosheiov2005NoteOS,
  title={Note on scheduling with general learning curves to minimize the number of tardy jobs},
  author={Gur Mosheiov and Jeffrey B. Sidney},
  journal={JORS},
  year={2005},
  volume={56},
  pages={110-112}
}
Several research studies have confirmed that people and organizations become better at their tasks as the tasks are repeated. The effect of this learning phenomenon on classical scheduling problems has been studied recently. One of the single-machine scheduling problems which seems to become nontrivial when learning effects are introduced is that of minimizing the number of tardy jobs. In this note, we study the special case where all jobs share a common due-date. We show that even when the… CONTINUE READING
Highly Cited
This paper has 62 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

A state-of-the-art review on scheduling with learning effects

European Journal of Operational Research • 2008
View 9 Excerpts
Highly Influenced

62 Citations

051015'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Scheduling problems with a learning effect

European Journal of Operational Research • 2001
View 1 Excerpt

Single-machine scheduling with learning considerations

European Journal of Operational Research • 1999

Computational survey of univariate and multivariate learning curve models

TP Wright
IEEE Trans Eng Mngt • 1992

An n job, one machine sequencing algorithm for minimizing the number of tardy jobs

JM Moore
Mngt Sci • 1968

Factors affecting the cost of airplanes

D Biskup
J Aeronaut Sci • 1936