Minimizing makespan on a single batching machine with release times and non-identical job sizes

Authors:
Shuguang Li;Guojun Li;Xiaoli Wang;Qiming Liu
Affiliations:
Department of Mathematics and Information Science, Yantai University, Yantai 264005, People's Republic of China;School of Mathematics and System Science, Shandong University, Jinan 250100, People's Republic of China and Institute of Software, Chinese Academy of Sciences, Beijing 100080, People's Republic of ...;School of Mathematics and System Science, Shandong University, Jinan 250100, People's Republic of China;School of Computer Science and Technology, Yantai Normal University, Yantai 264025, People's Republic of China
Venue:
Operations Research Letters
Year:
2005

Citing 4
Cited 12

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Approximation Algorithms in Batch Processing

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes

Computers and Operations Research
A PTAS for parallel batch scheduling with rejection and dynamic job arrivals

Theoretical Computer Science
Minimizing the makespan on a single parallel batching machine

Theoretical Computer Science
A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes

Computers and Operations Research
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes

Engineering Applications of Artificial Intelligence
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

Journal of Scheduling
Minimizing makespan on a single batch processing machine with non-identical job sizes: a hybrid genetic approach

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan

Operations Research Letters
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

Operations Research Letters
An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes

Applied Soft Computing
An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling jobs with release times and non-identical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worst-case ratio 2+@e, where @e0 can be made arbitrarily small.