Single machine scheduling with flow time and earliness penalties

@article{Bard1993SingleMS,
  title={Single machine scheduling with flow time and earliness penalties},
  author={Jonathan F. Bard and Krishnamurthi Venkatraman and Thomas A. Feo},
  journal={J. Global Optimization},
  year={1993},
  volume={3},
  pages={289-309}
}
This paper considers the problem of scheduling n jobs on a single machine to minimize the total cost incurred by their respective flow time and earliness penalties. It is assumed that each job has a due date that must be met, and that preemptions are not allowed. The problem is formulated as a dynamic program (DP) and solved with a reaching algorithm that exploits a series of dominance properties and efficiently generated bounds. A major factor underlying the effectiveness of the approach is… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Operations Sequencing in Discrete Parts Manufacturing

  • J. F. Bard, T. A. Feo
  • Management Science
  • 1989

A Branch and Bound Approach the Bicriterion

  • F.M.E. Raizadeh, P. Dileepan
  • Weighted Tardiness Problem, Operations Research
  • 1988

A Branch and Bound Approach the Bicriterion Problem Involving Total Flow Time and Range of Lateness

  • T. Sen, F. M. E. Raizadeh, P. Dileepan
  • Management Science
  • 1988

Single Machine Scheduling to Minimize Weighted Earliness Subject to No Tardy Jobs ,

  • S. Chand, H. Schneeberger
  • European Journal of Operational Research
  • 1988

Batching to Minimize Flow Times on One Machine

  • G. Dobson, U. S. Karmarkar, J. F. Rummel
  • Management Science
  • 1987

Single Machine Scheduling Research, Omega 15, 207-227

  • NP-Completeness, W. H. Freeman, Co, S. K. San Francisco. Gupta, J. Kyparisis
  • 1987

Similar Papers

Loading similar papers…