Flow shop scheduling with peak power consumption constraints

被引：0
|
作者：
Kan Fang
Nelson A. Uhan
Fu Zhao
John W. Sutherland
机构：
[1] Purdue University,School of Industrial Engineering
[2] United States Naval Academy,Mathematics Department
[3] Purdue University,Division of Environmental and Ecological Engineering and School of Mechanical Engineering
[4] Purdue University,Division of Environmental and Ecological Engineering
来源：
Annals of Operations Research | 2013年 / 206卷
关键词：
Scheduling; Flow shop; Energy; Peak power consumption; Integer programming; Combinatorial optimization;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study scheduling as a means to address the increasing energy concerns in manufacturing enterprises. In particular, we consider a flow shop scheduling problem with a restriction on peak power consumption, in addition to the traditional time-based objectives. We investigate both mathematical programming and combinatorial approaches to this scheduling problem, and test our approaches with instances arising from the manufacturing of cast iron plates.
引用
收藏
页码：115 / 145
页数：30
相关论文
共 50 条
  • [1] Flow shop scheduling with peak power consumption constraints
    Fang, Kan
    Uhan, Nelson A.
    Zhao, Fu
    Sutherland, John W.
    ANNALS OF OPERATIONS RESEARCH, 2013, 206 (01) : 115 - 145
  • [2] Decoding methods for the flow shop scheduling with peak power consumption constraints
    Wang, Jing-jing
    Wang, Ling
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2019, 57 (10) : 3200 - 3218
  • [3] Robust flow shop scheduling with random processing times for reduction of peak power consumption
    Nagasawa, Keisuke
    Ikeda, Yuto
    Irohara, Takashi
    SIMULATION MODELLING PRACTICE AND THEORY, 2015, 59 : 102 - 113
  • [4] Considering the peak power consumption problem with learning and deterioration effect in flow shop scheduling
    Lv, Dan-Yang
    Wang, Ji-Bo
    COMPUTERS & INDUSTRIAL ENGINEERING, 2024, 197
  • [5] Flow shop scheduling problems with transportation constraints revisited
    Lan, Yan
    Yuan, Yuan
    Wang, Yinling
    Han, Xin
    Zhou, Yong
    THEORETICAL COMPUTER SCIENCE, 2024, 985
  • [6] A note on the complexity of flow shop scheduling with transportation constraints
    Yuan, Jinjiang
    Soukhal, Ameur
    Chen, Youjun
    Lu, Lingfa
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 178 (03) : 918 - 925
  • [7] Flow shop scheduling problems with transportation and capacities constraints
    Oulamara, A
    Soukhal, A
    2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 2540 - 2545
  • [8] Flow Shop Scheduling Problems with Transportation Constraints Revisited
    Yuan, Yuan
    Han, Xin
    Lan, Yan
    COMPUTING AND COMBINATORICS, COCOON 2022, 2022, 13595 : 12 - 23
  • [9] Complexity of flow shop scheduling problems with transportation constraints
    Soukhal, A
    Oulamara, A
    Martineau, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 161 (01) : 32 - 41
  • [10] Power Scheduling for MSE Minimization with Peak and Average Power Constraints
    Nguyen, Duy H. N.
    Long Bao Le
    Tho Le-Ngoc
    2014 48TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2014,
12345