The Schedule-Sequencing Problem
Edward H. Bowman · Operations Research · 1959
A tentative solution to the general schedule-sequencing problem is presented in a linear-programming form. Feasible solutions hinge on work recently presented on integer solutions to linear-programming problems. As yet, the computation involved for a practical problem would be quite large.
Cited by 292 works. doi:10.1287/opre.7.5.621
Authors
References
- Outline of an algorithm for integer solutions to linear programs
- Discrete-Variable Extremum Problems
- Optimal two‐ and three‐stage production schedules with setup times included
- On the Solution of Discrete Programming Problems
- An integer linear‐programming model for machine scheduling
- Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Scientific Programming in Business and Industry.
- Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags