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

Authors:
Sheng Yu;Yinfeng Xu;Ming Liu;Feifeng Zheng
Affiliations:
School of Management, Xi'an Jiaotong University, Xi'an, Shaanxi Province, P.R. China;School of Management, Xi'an Jiaotong University, Xi'an, Shaanxi Province, P.R. China and Ministry of Education Key Lab for Process Control and Efficiency Engineering, Xi'an, P.R. China;School of Economics & Management, Tongji University, Shanghai, P.R. China;School of Management, Xi'an Jiaotong University, Xi'an, Shaanxi Province, P.R. China and Ministry of Education Key Lab for Process Control and Efficiency Engineering, Xi'an, P.R. China
Venue:
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Year:
2011

Citing 7
Cited 0

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
Scheduling jobs under simple linear deterioration

Computers and Operations Research
Time-Dependent Scheduling

Time-Dependent Scheduling
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Single-machine scheduling problems with deteriorating jobs and learning effects

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

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a single-machine scheduling model considering all of the following parameters: general deterioration and learning effects as well as general setup times. We prove that the shortest processing time (SPT) rule produces optimal schedules for the following seven minimization objectives: makespan, sum of αth (α ≥ 0) power of jobs' completion times, total weighted completion time, maximum lateness, total tardiness, total weighted tardiness, and number of tardy jobs. We further show that in the case of resumable scheduling with availability constraints, the above conclusions are still valid.