A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling

Authors:
Bibo Yang;Joseph Geunes;William J. O'Brien
Affiliations:
Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL;Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL;Rinker School of Building Construction, University of Florida, Gainesville, FL
Venue:
Computers and Operations Research
Year:
2004

Citing 4
Cited 3

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Structure of a simple scheduling polyhedron

Mathematical Programming: Series A and B
Genetic algorithms and tabu search: hybrids for optimization

Computers and Operations Research - Special issue on genetic algorithms
Essays and Surveys in Metaheuristics

Essays and Surveys in Metaheuristics

MRP Rescheduling heuristics with capacity extension under deterministic demand

Computers and Industrial Engineering - Special issue: Computational intelligence and information technology applications to industrial engineering selected papers from the 33 rd ICC&IE
A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times

Computers and Industrial Engineering
MRP rescheduling heuristics with capacity extension under deterministic demand

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

Many firms face practical scheduling challenges in balancing the costs of overtime against the costs of tardiness, where tardiness costs vary by job or project. This paper addresses this challenge by considering scheduling jobs for processing during a finite number of discrete periods on a single resource. The resource can process jobs in two modes, regular time and overtime, at different costs per unit time, and jobs cannot be preempted. Each job has associated release and due dates, and tardy jobs incur a job-specific cost per period tardy. The schedule planner wishes to minimize the sum of weighted job tardiness and resource overtime costs. We provide a pseudopolynomial time algorithm for determining the optimal usage of regular time and overtime for any fixed sequence of jobs. We use this algorithm as a subroutine for heuristically solving the general scheduling problem using a priority sequencing rule. A local search algorithm then improves upon the initial solution generated by the priority rules. We use a strengthened linear programming formulation to provide good lower bounds for assessing the performance of the heuristics. Computational tests show that the algorithm generates close to optimal solutions for problems with high tardiness costs in reasonable computing time.