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

Débora P. Ronconi, Warren B. Powell

Research output: Contribution to journalArticle

12 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)597-607
Number of pages11
JournalJournal of Scheduling
Volume13
Issue number6
DOIs
StatePublished - Dec 1 2010

All Science Journal Classification (ASJC) codes

  • Software
  • Engineering(all)
  • Management Science and Operations Research
  • Artificial Intelligence

Keywords

  • Approximate dynamic programming
  • Scheduling
  • Single machine
  • Tardiness

Fingerprint Dive into the research topics of 'Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming'. Together they form a unique fingerprint.

  • Cite this