Batching to minimize flow times on one machine
Management Science
One-pass batching algorithms for the one-machine problem
Discrete Applied Mathematics
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
Journal of the ACM (JACM)
A Polynomial Algorithm for the Two-Variable Integer Programming Problem
Journal of the ACM (JACM)
Single machine scheduling with batch-dependent setup times
Information Processing Letters
Batch scheduling on uniform machines to minimize total flow-time
Computers and Operations Research
Single machine batch scheduling problem with fuzzy batch size
Computers and Industrial Engineering
Scheduling with batching: minimizing the weighted number of tardy jobs
Operations Research Letters
Minimizing flow-time on a single machine with integer batch sizes
Operations Research Letters
Batch scheduling of identical jobs on parallel identical machines
Information Processing Letters
Minimizing maximum tardiness and delivery costs in a batched delivery system
Computers and Industrial Engineering
| Hi-index | 0.00 |
A problem of batching identical jobs on a single machine is studied. Constant processing times and batch setup times are assumed. An algorithm is presented to minimize the sum over all jobs of the batched completion times, and shown to run in time polynomial in the logarithms of the problem parameters.