Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Batch sizing and job sequencing on a single machine
Annals of Operations Research
The complexity of one-machine batching problems
Discrete Applied Mathematics - Special issue on new frontiers in the theory and practice of combinatorial optimization: applications in manufacturing and VLSI design
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
SIAM Journal on Computing
Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems
SIAM Journal on Discrete Mathematics
Approximation Techniques for Average Completion Time Scheduling
SIAM Journal on Computing
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Supply chain scheduling: Batching and delivery
Operations Research
A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
Computers and Operations Research
Efficient heuristics to minimize total flow time with release dates
Operations Research Letters
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
Operations Research Letters
| Hi-index | 0.00 |
We study single machine batch scheduling with release times. Our goal is to minimize the sum of weighted flow times (or completion times) and delivery costs. Since the problem is strongly $\mathcal{NP}$ -hard even with no delivery cost and identical weights for all jobs, an approximation algorithm is presented for the problem with identical weights. This uses the polynomial time solution we give for the preemptive version of the problem. We also present an evolutionary metaheuristic algorithm for the general case. Computational results show very small gaps between the results of the metaheuristic and the lower bound.