Lagrangian bounds for just-in-time job-shop scheduling

Formulating the single machine sequencing problem with release dates as a mixed integer program

Martin Dyer, Laurence A. Wolsey · Discrete Applied Mathematics · 1990 · 240 citations

Management, Industrial Engineering, Operations Management +12

Solving Project Scheduling Problems by Minimum Cut Computations

Rolf H. Möhring, Andreas S. Schulz, Frederik Stork et al. · Management Science · 2003 · 188 citations · Full text

Management, Industrial Engineering, Project Management +15

An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming method

Haoxun Chen, Chengbin Chu, J.-M. Proth · IEEE Transactions on Robotics and Automation · 1998 · 121 citations

Management, Industrial Engineering, Operations Management +14

An Implementation of Shor's r-Algorithm

Franz Kappel, Alexei V. Kuntsevich · Computational Optimization and Applications · 2000 · 111 citations

Computing, Computer Engineering, Computer Science +5

An alternative framework to Lagrangian relaxation approach for job shop scheduling

Haoxun Chen, Peter B. Luh · European Journal of Operational Research · 2003 · 98 citations

Management, Industrial Engineering, Operations Management +9