Single machine parallel-batch scheduling with deteriorating jobs

Authors:
Xianglai Qi;Shiguo Zhou;Jinjiang Yuan
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China
Venue:
Theoretical Computer Science
Year:
2009

Citing 11
Cited 3

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
V-shaped policies for scheduling deteriorating jobs

Operations Research
Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Scheduling jobs under simple linear deterioration

Computers and Operations Research
Parallel machine scheduling with time dependent processing times

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing the total weighted completion time of deteriorating jobs

Information Processing Letters
Scheduling jobs under decreasing linear deterioration

Information Processing Letters
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

Computers and Operations Research
Batch scheduling of step deteriorating jobs

Journal of Scheduling

Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs

Information Processing Letters
Scheduling an unbounded batching machine with job processing time compatibilities

Discrete Applied Mathematics
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider several single machine parallel-batch schedulingproblems in which the processing time of a job is a linear functionof its starting time. We give a polynomial-time algorithm forminimizing the maximum cost, an O(n5) timealgorithm for minimizing the number of tardy jobs, and anO(n2) time algorithm for minimizing thetotal weighted completion time. Furthermore, we prove that theproblem for minimizing the weighted number of tardy jobs is binaryNP-hard.