Scheduling problems with deteriorating jobs and learning effects including proportional setup times

Authors:
T. C. E. Cheng;Wen-Chiung Lee;Chin-Chia Wu
Affiliations:
Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 8
Cited 15

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
A new approach to the learning effect: Beyond the learning curve restrictions

Computers and Operations Research
Some scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect

Computers and Industrial Engineering
Solution algorithms for the makespan minimization problem with the general learning model

Computers and Industrial Engineering
Experience-based approach to scheduling problems with the learning effect

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Minimizing the makespan on a single machine with learning and unequal release times

Computers and Industrial Engineering
Single-machine group scheduling with resource allocation and learning effect

Computers and Industrial Engineering
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
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
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
Short Communication: A note on "Single machine scheduling with time-dependent deterioration and exponential learning effect"

Computers and Industrial Engineering
Two-agent scheduling with learning 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
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves

Computers and Industrial Engineering
Makespan minimization flowshop with position dependent job processing times-computational complexity and solution algorithms

Computers and Operations Research
Single machine scheduling with autonomous learning and induced learning

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, interest in scheduling with deteriorating jobs and learning effects has kept growing. However, research in this area has seldom considered setup times. We introduce a new scheduling model in which job deterioration and learning, and setup times are considered simultaneously. In the proposed model, the actual processing time of a job is defined as a function of the setup and processing times of the jobs already processed and the job's own scheduled position in a sequence. In addition, the setup times are assumed to be proportional to the actual processing times of the already scheduled jobs. We derive polynomial-time optimal solutions for some single-machine problems with or without the presence of certain conditions.