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

Ronconi, Debora P.; Powell, Warren B.

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

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

Full text
Author(s):	Ronconi, Debora P. ^[1] ; Powell, Warren B. ^[2] Total Authors: 2
Affiliation:	^[1] Univ Sao Paulo, Escola Politecn, Dept Prod Engn, BR-05508900 Sao Paulo - Brazil ^[2] Princeton Univ, Dept Operat Res & Financial Engn, Princeton, NJ 08544 - USA Total Affiliations: 2
Document type:	Journal article
Source:	JOURNAL OF SCHEDULING; v. 13, n. 6, p. 597-607, DEC 2010.
Web of Science Citations:	10
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. (AU)

FAPESP's process:	06/03496-3 - Theory and practice of cutting and packing problems
Grantee:	Marcos Nereu Arenales
Support Opportunities:	Research Projects - Thematic Grants

Short URL