Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times

Authors:
T. C. E. Cheng;J. J. Yuan;A. F. Yang
Affiliations:
Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China;Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China and Department of Mathematics, Zhengzhou University, Zhengzhou, Henan, Peop ...;Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China and Department of Mathematics, Zhengzhou University, Zhengzhou, Henan, Peop ...
Venue:
Computers and Operations Research
Year:
2005

Citing 5
Cited 6

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Scheduling one batch processor subject to job release dates

Discrete Applied Mathematics
Scheduling Algorithms

Scheduling Algorithms
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

Minimizing makespan for multi-spindle head machines with a mobile table

Computers and Operations Research
Single machine due date assignment scheduling problem with customer service level in fuzzy environment

Applied Soft Computing
Parallel batch scheduling of equal-length jobs with release and due dates

Journal of Scheduling
Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine

Computers & Mathematics with Applications
Enhanced mixed integer programming model for a transfer line design problem

Computers and Industrial Engineering
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the single machine parallel-batching scheduling problem with precedence relations, release dates and identical processing times to minimize a regular objective function. When the processing times are unit, we give an O(n2) time optimal algorithm. When there are no precedence relations, we solve this problem by dynamic programming in O(n3) time. When the precedence relations are "layerly complete", we solve this problem by a dynamic programming algorithm that runs in O(n7) time. For the total weighted completion time minimization problem, we give an O(n2) time 3/2-approximation algorithm. For the makespan minimization problem, we give an O(n2) time optimal algorithm and an expression of the minimum makespan.