摘要
This paper investigates a single machine scheduling problem to minimize energy consumption with bounded maximum tardiness. A set of jobs are to be processed on a single machine which is speed-scalable. Each job is characterized by its release time, deadline and processing time. The machine can process only one job with some speed at a time. No preemption is allowed. Since energy consumption is associated with the processing speed, both job sequencing and speed choosing decisions have to be made. Two MILP (mixed integer linear programming) models, which respectively use dichotomous constraints and assignment constraints to model the processing sequence of jobs, are built for this problem. The models are implemented in C++ and solved by CPLEX. Computational results with randomly generated instances demonstrate that the model using assignment constraints is much more efficient than that with dichotomous constraints.
| 源语言 | 英语 |
|---|---|
| 主期刊名 | ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control |
| 出版商 | Institute of Electrical and Electronics Engineers Inc. |
| 页 | 146-150 |
| 页数 | 5 |
| ISBN(电子版) | 9781479980697 |
| DOI | |
| 出版状态 | 已出版 - 1 6月 2015 |
| 活动 | 2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015 - Taipei, 中国台湾 期限: 9 4月 2015 → 11 4月 2015 |
出版系列
| 姓名 | ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control |
|---|
会议
| 会议 | 2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015 |
|---|---|
| 国家/地区 | 中国台湾 |
| 市 | Taipei |
| 时期 | 9/04/15 → 11/04/15 |
联合国可持续发展目标
此成果有助于实现下列可持续发展目标:
-
可持续发展目标 7 经济适用的清洁能源
指纹
探究 'Energy consumption minimization for single machine scheduling with bounded maximum tardiness' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver