Single machine scheduling to minimize the number of early and tardy jobs
Authors:
- Avital LannALAvital Lann
- Gur MosheiovGMGur Mosheiov
- 1 August 1996
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 23 (8) , 769-781
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costsOperations Research Letters, 1994
- Parallel-Machine Scheduling Problems with Earliness and Tardiness PenaltiesJournal of the Operational Research Society, 1994
- The parallel machine min-max weighted absolute lateness scheduling problemNaval Research Logistics (NRL), 1994
- Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problemsNaval Research Logistics (NRL), 1993
- Chapter 9 Sequencing and scheduling: Algorithms and complexity1993
- Sequencing with Earliness and Tardiness Penalties: A ReviewOperations Research, 1990
- An Algorithm for the Space-Shuttle Scheduling ProblemOperations Research, 1978
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968