Single machine scheduling to maximize the number of on-time jobs with generalized due-dates
Authors:
- 6 March 2020
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 23 (3) , 289-299
Abstract
No abstract availableKeywords
Funding Information
- Israel Science Foundation (2505/19)
This publication has 10 references indexed in Scilit:
- Two-agent single-machine scheduling with assignable due datesApplied Mathematics and Computation, 2012
- A note on the SPT heuristic for solving scheduling problems with generalized due datesComputers & Operations Research, 2004
- Single machine scheduling with assignable due datesDiscrete Applied Mathematics, 2002
- Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machineAnnals of Operations Research, 1999
- Single machine scheduling to minimize the number of early and tardy jobsComputers & Operations Research, 1996
- On the complexity of generalized due date scheduling problemsEuropean Journal of Operational Research, 1991
- Minimizing Total Tardiness on One Machine is NP-HardMathematics of Operations Research, 1990
- A note on the generalized due dates scheduling problemsNaval Research Logistics (NRL), 1990
- Scheduling Problems With Generalized Due DatesIIE Transactions, 1986
- Optimal Sequencing of a Single Machine Subject to Precedence ConstraintsManagement Science, 1973