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

管理学院

Xi'an Jiaotong University
Key Lab of the Ministry of Education for Process Control and Efficiency Egineering
Tongji University

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

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.

源语言	英语
主期刊名	Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings
页	64-73
页数	10
DOI	https://doi.org/10.1007/978-3-642-22616-8_6
出版状态	已出版 - 2011
活动	5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011 - Zhangjiajie, 中国期限: 4 8月 2011 → 6 8月 2011

丛书

姓名	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
卷	6831 LNCS
ISSN（印刷版）	0302-9743
ISSN（电子版）	1611-3349

会议

会议	5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011
国家/地区	中国
市	Zhangjiajie
时期	4/08/11 → 6/08/11

访问文件

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

其它文件与链接

链接到 Scopus 的出版物

引用此

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. 在 Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings (页码 64-73). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 6831 LNCS). https://doi.org/10.1007/978-3-642-22616-8_6

Yu, Sheng ; Xu, Yinfeng ; Liu, Ming 等. / 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. 页码 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. 在 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), 卷 6831 LNCS, 页码 64-73, 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011, Zhangjiajie, 中国, 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 等.
Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings. 2011. 页码 64-73 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 6831 LNCS).

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

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. 在 Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings. 2011. 页码 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

摘要

丛书

会议

访问文件

其它文件与链接

学术指纹

引用此