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

Sheng Yu; Yinfeng Xu; Ming Liu; Feifeng Zheng

doi:10.1007/978-3-642-22616-8_6

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

Sheng Yu
, Yinfeng Xu
, Ming Liu
, Feifeng Zheng

School of Management

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings
Pages	64-73
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-642-22616-8_6
State	Published - 2011
Event	5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011 - Zhangjiajie, China Duration: 4 Aug 2011 → 6 Aug 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6831 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011
Country/Territory	China
City	Zhangjiajie
Period	4/08/11 → 6/08/11

Keywords

Availability constraints
Deterioration effects
Learning effects
Past-sequence-dependent setup times
Single-machine scheduling

Access to Document

10.1007/978-3-642-22616-8_6

Cite this

Yu, S., Xu, Y., Liu, M., & Zheng, F. (2011). Optimal policy for single-machine scheduling with deterioration effects, learning effects, setup times, and availability constraints. In Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings (pp. 64-73). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6831 LNCS). https://doi.org/10.1007/978-3-642-22616-8_6

Yu, Sheng ; Xu, Yinfeng ; Liu, Ming et al. / Optimal policy for single-machine scheduling with deterioration effects, learning effects, setup times, and availability constraints. Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings. 2011. pp. 64-73 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a86f451f216a40dcb13d527f600ae0cb,

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

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.",

keywords = "Availability constraints, Deterioration effects, Learning effects, Past-sequence-dependent setup times, Single-machine scheduling",

author = "Sheng Yu and Yinfeng Xu and Ming Liu and Feifeng Zheng",

year = "2011",

doi = "10.1007/978-3-642-22616-8\_6",

language = "英语",

isbn = "9783642226151",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "64--73",

booktitle = "Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings",

note = "5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011 ; Conference date: 04-08-2011 Through 06-08-2011",

}

Yu, S, Xu, Y, Liu, M & Zheng, F 2011, Optimal policy for single-machine scheduling with deterioration effects, learning effects, setup times, and availability constraints. in Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6831 LNCS, pp. 64-73, 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011, Zhangjiajie, China, 4/08/11. https://doi.org/10.1007/978-3-642-22616-8_6

Optimal policy for single-machine scheduling with deterioration effects, learning effects, setup times, and availability constraints. / Yu, Sheng; Xu, Yinfeng; Liu, Ming et al.
Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings. 2011. p. 64-73 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6831 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Yu, Sheng

AU - Xu, Yinfeng

AU - Liu, Ming

AU - Zheng, Feifeng

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Availability constraints

KW - Deterioration effects

KW - Learning effects

KW - Past-sequence-dependent setup times

KW - Single-machine scheduling

UR - https://www.scopus.com/pages/publications/80052015450

U2 - 10.1007/978-3-642-22616-8_6

DO - 10.1007/978-3-642-22616-8_6

M3 - 会议稿件

AN - SCOPUS:80052015450

SN - 9783642226151

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 64

EP - 73

BT - Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings

T2 - 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011

Y2 - 4 August 2011 through 6 August 2011

ER -

Yu S, Xu Y, Liu M, Zheng F. Optimal policy for single-machine scheduling with deterioration effects, learning effects, setup times, and availability constraints. In Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings. 2011. p. 64-73. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-22616-8_6

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this