Single machine scheduling with time-dependent deterioration and exponential learning effect

Authors:
Xue Huang;Ji-Bo Wang;Li-Yan Wang;Wen-Jun Gao;Xue-Ru Wang
Affiliations:
Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang 110136, People's Republic of China;Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang 110136, People's Republic of China;Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang 110136, People's Republic of China and School of Mathematical Sciences, Dalian University of Technology, Dalian 1160 ...;Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang 110136, People's Republic of China;Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang 110136, People's Republic of China
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 3
Cited 10

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

Computers and Operations Research
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects

Information Sciences: an International Journal
Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times

Computers & Mathematics with Applications

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

Computers and Industrial Engineering
Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times

Computers and Operations Research
A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs

Computers and Operations Research
Single-machine scheduling jobs with exponential learning functions

Computers and Industrial Engineering
Single-machine group scheduling with both learning effects and deteriorating jobs

Computers and Industrial Engineering
Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects

Computers and Industrial Engineering
Deteriorating job scheduling to minimize the number of late jobs with setup times

Computers and Industrial Engineering
Short Communication: A note on "Single machine scheduling with time-dependent deterioration and exponential learning effect"

Computers and Industrial Engineering
Single-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration

Computers and Industrial Engineering
Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the single machine scheduling problems with time-dependent deterioration and exponential learning effect, i.e., the actual processing time of a job depends not only on the processing times of the jobs already processed but also on its scheduled position. We consider the following objective functions: the makespan, the sum of the @dth (@d=0) power of job completion times, the total weighted completion time and the maximum lateness. We show that the makespan minimization problem, the sum of the @dth power of job completion times minimization problem can be solved by the smallest (normal) processing time first (SPT) rule, respectively. We also show that the total weighted completion time minimization problem and the maximum lateness minimization problem can be solved in polynomial time under certain conditions.