Scheduling with batching: minimizing the weighted number of tardy jobs
- 30 September 1994
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 16 (2) , 79-86
- https://doi.org/10.1016/0167-6377(94)90063-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The complexity of one-machine batching problemsDiscrete Applied Mathematics, 1993
- A polynomial algorithm for a one machine batching problemOperations Research Letters, 1992
- Batch sizing and job sequencing on a single machineAnnals of Operations Research, 1990
- 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
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover CostsSIAM Journal on Computing, 1978
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969