Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling

Computers and Operations Research

Volumn 34, Issue 9, 2007, Pages 2625-2636

  Tang, Lixin ^a   Xuan, Hua ^a   Liu, Jiyin ^b  

^a NORTHEASTERN UNIVERSITY   (China)

^b LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

Hybrid backward and forward dynamic programming; Lagrangian relaxation; Precedence constraint; Single machine scheduling; Weighted tardiness

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; DYNAMIC PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

DYNAMIC PROGRAMMING ALGORITHM; HYBRID BACKWARD AND FORWARD DYNAMIC PROGRAMMING; LAGRANGIAN RELAXATION; PRECEDENCE CONSTRAINT; SINGLE MACHINE SCHEDULING; WEIGHTED TARDINESS;

LAGRANGE MULTIPLIERS;

EID: 33846569020     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.10.006     Document Type: Article

References (11)

1. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimisation and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
2. Lawler E.L. A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1 (1977) 331-342
3. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
4. Abdul-Razaq T.S., Potts C.N., and Van Wassenhove L.N. A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Applied Mathematics 26 (1990) 235-253
5. Potts C.N., and Van Wassenhove L.N. A branch and bound algorithm for the single machine, total weighted tardiness problem. Operational Research 33 (1985) 363-377
6. Holsenback J.E., Russell R.M., Markland R.E., and Philipoom P.R. An improved heuristic for the single-machine, weighted tardiness problem. Omega, The International Journal of Management Science 27 (1999) 485-495
7. Volgenant A., and Teerhuis E. Improved heuristics for the n-job single machine weighted tardiness problem. Computers & Operations Research 26 1 (1999) 35-44
8. Kanet J.J., and Li X. A weighted modified due date rule for sequencing to minimize tardiness. Journal of Scheduling 7 (2004) 261-276
9. Beasley J.E. Lagrangian relaxation. In: Reeves C.R. (Ed). Modern heuristic techniques for combinatorial problems (1993), Blackwell Scientific, Oxford 243-303
10. Luh P.B., Hoitomt D.J., Max E., and Pattipati K.R. Schedule generation and reconfiguration for parallel machines. IEEE Transaction Robotics and Automation 6 (1990) 687-696
11. Zhang Y.H., Luh P.B., Narimatsu K., Moriya T., Shimada T., and Fang L. A macro-level scheduling method using Lagrangian relaxation. IEEE Transactions on Robotics and Automation 17 1 (2001) 70-79