More efficient Lagrangian relaxation approach to job-shop scheduling problems

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 1, Issue , 1995, Pages 496-501

  Chen, Haoxun ^a   Chu, Chengbin ^a   Proth, Jean Marie ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; JOB ANALYSIS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; RELAXATION PROCESSES; SCHEDULING;

JOB-SHOP SCHEDULING PROBLEMS; LAGRANGIAN RELAXATION APPROACH; PSEUDOPOLYNOMIAL TIME DYNAMIC PROGRAMMING; SOLUTION OSCILLATION; STOCHASTIC OPTIMIZATION METHODS;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 0029179964     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)