Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine

Authors:
Zhaohui Liu;T. C. Edwin Cheng
Affiliations:
Department of Mathematics, East China University of Science and Technology, Shanghai, People's Republic of China and Department of Logistics, The Hong Kong Polytechnic University, Kowloon, Hong Ko ...;Department of Logistics, The Hong Kong Polytechnic University, Kowloon, Hong Kong SAR, People's Republic of China
Venue:
Theoretical Computer Science
Year:
2005

Citing 5
Cited 3

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Minimizing mean response time in batch processing system

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On scheduling an unbounded batch machine

Operations Research Letters

Scheduling jobs with release dates on parallel batch processing machines

Discrete Applied Mathematics
Production-transportation scheduling model on a single batching machine

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Short Communication: On scheduling unbounded batch processing machine(s)

Computers and Industrial Engineering

Quantified Score

Hi-index	5.23

Visualization

Abstract

A batch machine is a machine that can process a number of jobs simultaneously as a batch, and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. In this paper, we present a polynomial time approximation scheme (PTAS) for scheduling a batch machine to minimize the total completion time with job release dates. Also, we present a fully polynomial time approximation scheme (FPTAS) for scheduling an unbounded batch machine, which can process an arbitrary number of jobs simultaneously, to minimize the total weighted completion time with job release dates.