Energy consumption minimization for single machine scheduling with bounded maximum tardiness

Ada Che; Ke Lv; Eugene Levner; Vladimir Kats

doi:10.1109/icnsc.2015.7116025

Energy consumption minimization for single machine scheduling with bounded maximum tardiness

Ada Che
, Ke Lv
, Eugene Levner
, Vladimir Kats

Northwestern Polytechnical University Xian
Ashkelon Academic College
Institute for Industrial Mathematics Israel

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

13 Scopus citations

Abstract

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.

Original language	English
Title of host publication	ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	146-150
Number of pages	5
ISBN (Electronic)	9781479980697
DOIs	https://doi.org/10.1109/icnsc.2015.7116025
State	Published - 1 Jun 2015
Externally published	Yes
Event	2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015 - Taipei, Taiwan, Province of China Duration: 9 Apr 2015 → 11 Apr 2015

Publication series

Name	ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control

Conference

Conference	2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015
Country/Territory	Taiwan, Province of China
City	Taipei
Period	9/04/15 → 11/04/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

Funding

Funders	Funder number
National Natural Science Foundation of China	71471145

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Keywords

energy consumption
maximum tardiness
scheduling
single machine
speed scaling

Access to Document

10.1109/icnsc.2015.7116025

Cite this

Che, A., Lv, K., Levner, E., & Kats, V. (2015). Energy consumption minimization for single machine scheduling with bounded maximum tardiness. In ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control (pp. 146-150). Article 7116025 (ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/icnsc.2015.7116025

Che, Ada ; Lv, Ke ; Levner, Eugene et al. / Energy consumption minimization for single machine scheduling with bounded maximum tardiness. ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 146-150 (ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control).

@inproceedings{9f8afd2464fd4a118077675ec00eaf50,

title = "Energy consumption minimization for single machine scheduling with bounded maximum tardiness",

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

keywords = "energy consumption, maximum tardiness, scheduling, single machine, speed scaling",

author = "Ada Che and Ke Lv and Eugene Levner and Vladimir Kats",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015 ; Conference date: 09-04-2015 Through 11-04-2015",

year = "2015",

month = jun,

day = "1",

doi = "10.1109/icnsc.2015.7116025",

language = "אנגלית",

series = "ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "146--150",

booktitle = "ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control",

address = "ארצות הברית",

}

Che, A, Lv, K, Levner, E & Kats, V 2015, Energy consumption minimization for single machine scheduling with bounded maximum tardiness. in ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control., 7116025, ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control, Institute of Electrical and Electronics Engineers Inc., pp. 146-150, 2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015, Taipei, Taiwan, Province of China, 9/04/15. https://doi.org/10.1109/icnsc.2015.7116025

Energy consumption minimization for single machine scheduling with bounded maximum tardiness. / Che, Ada; Lv, Ke; Levner, Eugene et al.
ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control. Institute of Electrical and Electronics Engineers Inc., 2015. p. 146-150 7116025 (ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control).

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

TY - GEN

T1 - Energy consumption minimization for single machine scheduling with bounded maximum tardiness

AU - Che, Ada

AU - Lv, Ke

AU - Levner, Eugene

AU - Kats, Vladimir

PY - 2015/6/1

Y1 - 2015/6/1

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

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

KW - energy consumption

KW - maximum tardiness

KW - scheduling

KW - single machine

KW - speed scaling

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

U2 - 10.1109/icnsc.2015.7116025

DO - 10.1109/icnsc.2015.7116025

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84941248712

T3 - ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control

SP - 146

EP - 150

BT - ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2015 12th IEEE International Conference on Networking, Sensing and Control, ICNSC 2015

Y2 - 9 April 2015 through 11 April 2015

ER -

Che A, Lv K, Levner E, Kats V. Energy consumption minimization for single machine scheduling with bounded maximum tardiness. In ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control. Institute of Electrical and Electronics Engineers Inc. 2015. p. 146-150. 7116025. (ICNSC 2015 - 2015 IEEE 12th International Conference on Networking, Sensing and Control). doi: 10.1109/icnsc.2015.7116025

Energy consumption minimization for single machine scheduling with bounded maximum tardiness

Abstract

Publication series

Conference

Bibliographical note

Funding

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this