Single-machine scheduling problems with deteriorating jobs and learning effects

Authors:
Li Sun
Affiliations:
Department of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, China
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 9
Cited 14

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
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
Scheduling deteriorating jobs on a single machine with release times

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

Information Sciences: an International Journal
A two-machine flowshop makespan scheduling problem with deteriorating jobs

Computers and Industrial Engineering
Some scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
Single-machine and flowshop scheduling with a general learning effect model

Computers and Industrial Engineering

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
Scheduling problems with general effects of deterioration and learning

Information Sciences: an International Journal
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 single-machine scheduling problems with a truncation learning effect

Computers and Industrial Engineering
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations

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

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

Computers and Industrial Engineering
Optimal policy for single-machine scheduling with deterioration effects, learning effects, setup times, and availability constraints

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Two-machine flowshop scheduling with truncated learning to minimize the total completion time

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

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

Computers and Industrial Engineering
Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations

Journal of Intelligent Manufacturing
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 introduce a new scheduling model in which deteriorating jobs and learning effect are both considered simultaneously. By deterioration and the learning effect, we mean that the actual processing time of a job depends not only on the processing time of the jobs already processed but also on its scheduled position. For the single-machine case, we show that the problems of makespan, total completion time and the sum of the quadratic job completion times remain polynomially solvable, respectively. In addition,we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain conditions.