A polynomial algorithm for a one machine batching problem
- 31 May 1992
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 11 (4) , 213-218
- https://doi.org/10.1016/0167-6377(92)90027-z
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Optimal Scheduling of Products with Two Subassemblies on a Single MachineOperations Research, 1989
- One-pass batching algorithms for the one-machine problemDiscrete Applied Mathematics, 1988
- Batching to Minimize Flow Times on One MachineManagement Science, 1987
- A Polynomial Algorithm for the Two-Variable Integer Programming ProblemJournal of the ACM, 1980
- A Polynomial-Time Algorithm for the Knapsack Problem with Two VariablesJournal of the ACM, 1976