Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

Authors:
Débora P. Ronconi;Warren B. Powell
Affiliations:
Departamento de Engenharia de Produção, Escola Politécnica, Universidade de São Paulo, São Paulo, Brazil 05508-900;Department of Operations Research and Financial Engineering, Princeton University, Princeton, USA 08544
Venue:
Journal of Scheduling
Year:
2010

Citing 11
Cited 1

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Dynamic non-preemptive single machine scheduling

Computers and Operations Research
Introduction to Reinforcement Learning

Introduction to Reinforcement Learning
Neuro-Dynamic Programming

Neuro-Dynamic Programming
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

Operations Research
The Linear Programming Approach to Approximate Dynamic Programming

Operations Research
A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness

Journal of Scheduling
Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming

Machine Learning
The Dynamic Assignment Problem

Transportation Science
Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics)

Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics)
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Analysis of computer job control under uncertainty

Journal of Computer and Systems Sciences International

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs only at the beginning of periodic intervals. A customized approximate dynamic programming method is introduced for this problem. The authors also present numerical experiments that assess the reliability of the new approach and show that it performs better than a myopic policy.