Minimizing total weighted tardiness and overtime costs for single machine preemptive scheduling
Authors:
- Fernando JaramilloFJFernando Jaramillo
- Murat ErkocMEMurat Erkoc
- 1 May 2017
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 107, 109-119
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- The single-machine total tardiness scheduling problem: Review and extensionsEuropean Journal of Operational Research, 2010
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardinessOperations Research Letters, 2009
- The one-machine just-in-time scheduling problem with preemptionDiscrete Optimization, 2009
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteriaEuropean Journal of Operational Research, 2005
- Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion TimesAnnals of Operations Research, 2005
- A heuristic approach for minimizing weighted tardiness and overtime costs in single resource schedulingComputers & Operations Research, 2004
- Overtime Scheduling: An Application in Finite-capacity Real-time SchedulingJournal of the Operational Research Society, 1996
- A survey of algorithms for the single machine total weighted tardiness scheduling problemDiscrete Applied Mathematics, 1990
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Complexity of Machine Scheduling Problems1977