Voir la notice de l'article provenant de la source Numdam
Time-of-use (TOU) electricity pricing has been a common practice to enhance the peak load regulation capability of power grid. Meanwhile, it provides a good opportunity for industries to reduce energy costs, especially for energy-intensive ones, where batch scheduling is often involved. Majority of batch scheduling problems have been proved to be NP-hard, even for most single-machine environments. Optimizing batch scheduling under TOU policy in these industries will be of great significance. Single-machine batch scheduling is an important basis for more complicated shop scheduling problems. This paper investigates a bi-objective single-machine batch scheduling problem under TOU policy: the first objective is to minimize the makespan and the second is to minimize the total electricity costs. The considered problem is first formulated as a bi-objective mix-integer linear programming (MILP) model and is demonstrated to be NP-hard. Subsequently, the MILP is simplified by analyzing properties and search space for a Pareto optimal solution is greatly reduced. Then, an exact -constraint method is adapted to obtain its Pareto front, which is accelerated due to these properties. Finally, a preferable solution is recommended for decision makers via a fuzzy-logic-based approach. Computational results on randomly generated instances show the effectiveness of the proposed approach.
Cheng, Junheng 1, 2 ; Chu, Feng 2, 3 ; Chu, Chengbin 4 ; Xia, Weili 4
@article{RO_2016__50_4-5_715_0,
author = {Cheng, Junheng and Chu, Feng and Chu, Chengbin and Xia, Weili},
title = {Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {715--732},
publisher = {EDP-Sciences},
volume = {50},
number = {4-5},
year = {2016},
doi = {10.1051/ro/2015063},
zbl = {1353.90057},
mrnumber = {3570526},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2015063/}
}
TY - JOUR AU - Cheng, Junheng AU - Chu, Feng AU - Chu, Chengbin AU - Xia, Weili TI - Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2016 SP - 715 EP - 732 VL - 50 IS - 4-5 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ro/2015063/ DO - 10.1051/ro/2015063 LA - en ID - RO_2016__50_4-5_715_0 ER -
%0 Journal Article %A Cheng, Junheng %A Chu, Feng %A Chu, Chengbin %A Xia, Weili %T Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices %J RAIRO - Operations Research - Recherche Opérationnelle %D 2016 %P 715-732 %V 50 %N 4-5 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ro/2015063/ %R 10.1051/ro/2015063 %G en %F RO_2016__50_4-5_715_0
Cheng, Junheng; Chu, Feng; Chu, Chengbin; Xia, Weili. Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices. RAIRO - Operations Research - Recherche Opérationnelle, Special issue - Advanced Optimization Approaches and Modern OR-Applications, Tome 50 (2016) no. 4-5, pp. 715-732. doi: 10.1051/ro/2015063
Cité par Sources :