Batching to minimize flow times on one machine
Management Science
Integer and combinatorial optimization
Integer and combinatorial optimization
Batching to minimize flow times on parallel heterogeneous machines
Management Science
Single facility multi-class job scheduling
Computers and Operations Research
Scheduling two job classes on a single machine
Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation algorithms for problems in scheduling with set-ups
Discrete Applied Mathematics
Robust scheduling on a single machine to minimize total flow time
Computers and Operations Research
An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
Computers & Mathematics with Applications
Batch scheduling to minimize maximum lateness
Operations Research Letters
| Hi-index | 0.00 |
We address single and multiple machine versions of the batch scheduling problem which arises when there are job families and setup requirements between these families; our aim is to minimize the total of the completion or weighted completion times. The observations provided by us extend past results.