Single-machine scheduling with learning effect and deteriorating jobs

Authors:
Ji-Bo Wang
Affiliations:
Operations Research and Cybernetics Institute, School of Science, Shenyang Institute of Aeronautical Engineering, Shenyang 110136, China
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 14
Cited 7

Scheduling deteriorating jobs on a single processor

Operations Research
V-shaped policies for scheduling deteriorating jobs

Operations Research
Scheduling jobs under simple linear deterioration

Computers and Operations Research
Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine

Computers and Industrial Engineering
Parallel machine scheduling with time dependent processing times

Discrete Applied Mathematics
The complexity of scheduling starting time dependent tasks with release times

Information Processing Letters
Three scheduling problems with deteriorating jobs to minimize the total completion time

Information Processing Letters
Minimizing the total weighted completion time of deteriorating jobs

Information Processing Letters
A bi-criterion single-machine scheduling problem with learning considerations

Acta Informatica
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects

Information Sciences: an International Journal
Some scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
Single-machine scheduling with general learning functions

Computers & Mathematics with Applications
Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect

Computers and Industrial Engineering
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
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
Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects

Computers and Industrial Engineering
Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the single-machine scheduling problems with the effects of learning and deterioration. By the effects of learning and deterioration, we mean that job processing times are defined by functions of their starting times and positions in the sequence. It is shown that even with the introduction of learning effect and deteriorating jobs to job processing times, single machine makespan and sum of completion times (square) minimization problems remain polynomially solvable, respectively. But for the following objective functions: the weighted sum of completion times and the maximum lateness, this paper proves that the WSPT rule and the EDD rule can construct the optimal sequence under some special cases, respectively.