Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
- 303 Downloads
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.
KeywordsTardiness Approximate dynamic programming Single machine Scheduling
Unable to display preview. Download preview PDF.
- Bertsekas, D. P., & Tsitsiklis, J. N. (1996). Neuro-dynamic programming. Belmont: Athena Scientific. Google Scholar
- Powell, W. B., & Van Roy, B. (2004). Approximate dynamic programming for high dimensional resource allocation problems. In J. Si, A. G. Barto, & W. B. Powell II (Eds.), Handbook of learning and approximate dynamic programming. New York: IEEE Press. Google Scholar
- Pinedo, M. (2002). Scheduling: theory, algorithms, and systems. Upper Saddle River: Prentice-Hall. Google Scholar
- Sutton, R., & Barto, A. (1998). Reinforcement learning. Cambridge: MIT Press. Google Scholar