ELECTRICITY POWER COST-AWARE SCHEDULING OF JOBS ON PARALLEL BATCH PROCESSING MACHINES

被引：0
|
作者：
Rocholl, Jens [1 ]
Moench, Lars [1 ]
Fowler, John W. [2 ]
机构：
[1] Univ Hagen, Dept Math & Comp Sci, Univ Str 1, D-58097 Hagen, Germany
[2] Arizona State Univ, Dept Supply Chain Management, Main Campus,POB 874706, Tempe, AZ 85287 USA
来源：
2018 WINTER SIMULATION CONFERENCE (WSC) | 2018年
关键词：
ENERGY; OPTIMIZATION; CONSUMPTION; FAMILIES;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We discuss a bicriteria scheduling problem for parallel identical batch processing machines in semi-conductor wafer fabrication facilities (wafer fabs). Only jobs that belong to the same family can be batched together. The performance measures of interest are the total weighted completion time and the electricity power cost. Unequal release dates of the jobs are taken into account. The jobs can have non-identical sizes. We provide a Mixed Integer Linear Programming (MILP) formulation for the general setting. Moreover, we analyze the special case where all jobs have the same size, the maximum batch size is an integer multiple of this job size, and all jobs are available at time zero. We prove certain properties of Pareto-optimal schedules for this special case. These properties lead to a MILP formulation that is more tractable than the one for the general setting. We perform computational experiments with the epsilon-constraint method for both formulations.
引用
收藏
页码：3420 / 3431
页数：12
相关论文
共 50 条
  • [31] Optimal Algorithms and a PTAS for Cost-Aware Scheduling
    Chen, Lin
    Megow, Nicole
    Rischke, Roman
    Stougie, Leen
    Verschae, Jose
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT II, 2015, 9235 : 211 - 222
  • [32] Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics
    Bilyk, Andrew
    Moench, Lars
    Almeder, Christian
    COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 78 : 175 - 185
  • [33] Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
    Li, Wenhua
    Zhang, Zhenkun
    Yang, Sufang
    INFORMATION PROCESSING LETTERS, 2012, 112 (07) : 292 - 297
  • [34] Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
    Xin, Xiao
    Khan, Muhammad Ijaz
    Li, Shuguang
    OPEN MATHEMATICS, 2023, 21 (01):
  • [35] Optimal on-line algorithms for scheduling on parallel batch processing machines
    Zhang, GC
    Cai, XQ
    Wong, CK
    IIE TRANSACTIONS, 2003, 35 (02) : 175 - 181
  • [36] Integrated Production and Transportation Scheduling on Parallel Batch-Processing Machines
    Feng, Xin
    Xu, Zhongyue
    IEEE ACCESS, 2019, 7 : 148393 - 148400
  • [37] Privacy-aware and cost-aware workflow scheduling in clouds
    Wen Y.
    Liu J.
    Chen C.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2016, 22 (02): : 294 - 301
  • [38] Scheduling jobs on parallel machines to minimize a regular step total cost function
    Boris Detienne
    Stéphane Dauzère-Pérès
    Claude Yugma
    Journal of Scheduling, 2011, 14 : 523 - 538
  • [39] Scheduling jobs on unrelated parallel machines to minimize regular total cost functions
    Azizoglu, Meral
    Kirca, Omer
    IIE Transactions (Institute of Industrial Engineers), 1999, 31 (02): : 153 - 159
  • [40] Scheduling jobs on unrelated parallel machines to minimize regular total cost functions
    Azizoglu, M
    Kirca, O
    IIE TRANSACTIONS, 1999, 31 (02) : 153 - 159
12345