Single machine group scheduling under decreasing linear deterioration

Authors:
Ji-Bo Wang;Ai-Xia Guo;Feng Shan;Bo Jiang;Li-Yan Wang
Affiliations:
Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, P. R. China;The Chinese People's Armed Police Forces Academy, Langfang, P.R. China;Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, P. R. China;Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, P. R. China;Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, P. R. China
Venue:
Journal of Applied Mathematics and Computing
Year:
2007

Citing 9
Cited 7

Scheduling deteriorating jobs on a single processor

Operations Research
V-shaped policies for scheduling deteriorating jobs

Operations Research
Complexity of scheduling tasks with time-dependent execution times

Information Processing Letters
Scheduling jobs under simple linear deterioration

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

Discrete Applied Mathematics
Scheduling linearly deteriorating jobs on multiple machines

Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
Three scheduling problems with deteriorating jobs to minimize the total completion time

Information Processing Letters
Scheduling jobs under decreasing linear deterioration

Information Processing Letters
Flow shop scheduling problems with decreasing linear deterioration under dominant machines

Computers and Operations Research

Single-machine group scheduling problems with deterioration consideration

Computers and Operations Research
A two-machine flowshop makespan scheduling problem with deteriorating jobs

Computers and Industrial Engineering
A deteriorating jobs problem with quadratic function of job lateness

Computers and Industrial Engineering
A note on optimal policies for two group scheduling problems with deteriorating setup and processing times

Computers and Industrial Engineering
Single-machine group scheduling problems under the effects of deterioration and learning

Computers and Industrial Engineering
Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness

Computers and Operations Research
A single-machine scheduling with a truncated linear deterioration and ready times

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems.