Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

Authors:
Chuanli Zhao;Hengyong Tang
Affiliations:
School of Mathematics and Systems Science, Shenyang Normal University, Shenyang, Liaoning 110034, People's Republic of China;School of Mathematics and Systems Science, Shenyang Normal University, Shenyang, Liaoning 110034, People's Republic of China
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 10
Cited 3

Optimal common due-data with limited completion time deviation

Computers and Operations Research
Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
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
Minimizing the total weighted completion time of deteriorating jobs

Information Processing Letters
Single machine scheduling with past-sequence-dependent setup times and learning effects

Information Processing Letters
Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect

Computers and Industrial Engineering
Scheduling a maintenance activity and due-window assignment on a single machine

Computers and Operations Research
Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance

Computers and Operations Research

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
Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed that the job processing times are defined by functions dependent on their starting times. The following objectives are considered: the makespan, the total completion time, and the sum of earliness, tardiness, and due-window starting time and size penalties. We propose polynomial time algorithms to solve these problems.