An exact algorithm for single-machine scheduling without machine idle time

This study proposes an exact algorithm for the general single-machine scheduling problem without machine idle time to minimize the total job completion cost. Our algorithm is based on the Successive Sublimation Dynamic Programming (SSDP) method. Its major drawback is heavy memory usage to store dyna...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of Scheduling Vol. 12; no. 6; pp. 575 - 593
Main Authors:	Tanaka, Shunji, Fujikuma, Shuji, Araki, Mituhiko
Format:	Journal Article
Language:	English
Published:	Boston Springer Science and Business Media LLC 01.12.2009 Springer US Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Dynamic programming Experiments Integer programming Operations Research/Decision Theory Optimization Production scheduling Scheduling Studies Supply Chain Management Single-machine scheduling Successive sublimation dynamic programming method Time-indexed formulation Exact algorithm Lagrangian relaxation
ISSN:	1094-6136, 1099-1425
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!