A dual algorithm for the one-machine scheduling problem

Mathematical Programming

Volumn 11, Issue 1, 1976, Pages 229-251

  Fisher, Marshall L ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPERATIONS RESEARCH;

MATHEMATICAL PROGRAMMING;

EID: 0017240964     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01580393     Document Type: Article

References (24)

1. An experimental comparison of solution algorithms for the single-machine tardiness problem
2. H. Emmons, “One machine sequencing to minimize certain functions of job tardiness”, Operations Research 17 (4) (1969).
3. Optimal solution of scheduling problems using Lagrange multipliers: Part I
4. Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: Part I, theory
5. Lagrangian relaxation for integer programming
6. A linear programming approach to the cutting-stock problem
7. Relaxation methods for pure and mixed integer programming problems
8. The travelling-salesman problem and minimum spanning trees: Part II
9. Validation of subgradient optimization
10. The BOXSTEP method for large scale optimization
11. E.L. Lawler, “On scheduling problems with deferral costs”, Management Science 9 (4) (1963).
12. Branch and bound strategies for dynamic programming
13. Minimizing total cost in one-machine scheduling
14. On the n-job, one machine, sequence-independent scheduling problem with tardiness penalties: a branch-bound solution
15. A hybrid algorithm for the one machine sequencing problem to minimize total tardiness