Scheduling jobs with release dates on parallel batch processing machines

Authors:
L. L. Liu;C. T. Ng;T. C. E. Cheng
Affiliations:
School of Science, Shanghai Second Polytechnic University, No.2360 Jinhai Road, Pudong, Shanghai 201209, China;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 6
Cited 1

Minimizing Mean Completion Time in a Batch Processing System

Algorithmica
Note: minimizing makespan with release times on identical parallel batching machines

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

Theoretical Computer Science
Approximation schemes for constrained scheduling problems

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Efficient scheduling algorithms for a single batch processing machine

Operations Research Letters
On scheduling an unbounded batch machine

Operations Research Letters

Research on computational intelligence algorithms with adaptive learning approach for scheduling problems with batch processing machines

Neurocomputing

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper we consider the problem of scheduling jobs with release dates on parallel unbounded batch processing machines to minimize the maximum lateness. We show that the case where the jobs have deadlines is strongly NP-hard. We develop a polynomial-time approximation scheme for the problem to minimize the maximum delivery completion time, which is equivalent to minimizing the maximum lateness from the optimization viewpoint.