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

Authors:
Q. Q. Nong;T. C. E. Cheng;C. T. Ng
Affiliations:
Department of Mathematics, Ocean University of China, Qingdao, Shandong 266071, People's Republic of China;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China
Venue:
Operations Research Letters
Year:
2008

Citing 7
Cited 7

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Scheduling one batch processor subject to job release dates

Discrete Applied Mathematics
The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard

Journal of Scheduling
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Theoretical Computer Science
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

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

Operations Research Letters

Note: A best online algorithm for scheduling on two parallel batch machines

Theoretical Computer Science
Online scheduling on unbounded parallel-batch machines to minimize the makespan

Information Processing Letters
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan

Information Processing Letters
Online scheduling on unbounded parallel-batch machines with incompatible job families

Theoretical Computer Science
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time

Information Processing Letters
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead

Information Processing Letters
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. The objective is to minimize the makespan. We provide an algorithm for the problem that is better than one given in the literature, improving the competitive ratio from 32 to 2.