New Scheduling Approach for Shared Resources and Mixed Storage Policies

被引:0
|
作者
Castro, Pedro M. [1 ]
Zeballos, Luis J. [1 ,2 ]
Mendez, Carlos A. [3 ]
机构
[1] UMOSE, Lab Nacl Energia & Geol, P-1649038 Lisbon, Portugal
[2] Univ Nacl Litoral, Fac Ingn Quim, Santa Fe, Argentina
[3] INTEC Univ Nacl Litoral CONICET, Santa Fe, Argentina
关键词
optimization; mixed-integer linear program; mathematical modeling; FORMULATION; BATCH;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We propose a new mixed-integer linear programming (MILP) model for scheduling automated wet-etching stations (AWS), which can be classified as a multistage batch plant with both zero-wait and local storage policies and featuring a robot for moving the wafer lots from one stage to the next. The novelty is the use of a slot-based approach for handling the processing tasks together with general precedence sequencing variables for dealing with the transportation tasks. The performance of the new continuous-time model is shown to be significantly better than a pure sequencing based formulation and a closely related hybrid model taken from the literature.
引用
收藏
页码:975 / 979
页数:5
相关论文
共 50 条
  • [11] Receding horizon scheduling of processes with shared resources
    de Prada, Cesar
    Mazaeda, Rogelio
    Cristea, Smaranda R.
    COMPUTERS & CHEMICAL ENGINEERING, 2019, 125 : 1 - 12
  • [12] PRODUCTION SCHEDULING ON MULTIPLE LINES WITH SHARED RESOURCES
    Costantino, Francesco
    Di Gravio, Giulio
    Nonino, Fabio
    Cappannoli, Matteo
    Silvestri, Tommaso
    24TH EUROPEAN MODELING AND SIMULATION SYMPOSIUM (EMSS 2012), 2012, : 334 - 339
  • [13] Innovation - A new approach to the distribution and storage of genetic resources
    Hayashizaki, Y
    Kawai, J
    NATURE REVIEWS GENETICS, 2004, 5 (03) : 223 - 228
  • [14] Latency Fairness Scheduling for Shared Storage Systems
    Peng, Yuhan
    Liu, Qingyue
    Varman, Peter
    2019 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE AND STORAGE (NAS), 2019, : 1 - 8
  • [15] Scheduling shared continuous resources on many-cores
    Ernst Althaus
    André Brinkmann
    Peter Kling
    Friedhelm Meyer auf der Heide
    Lars Nagel
    Sören Riechers
    Jiří Sgall
    Tim Süß
    Journal of Scheduling, 2018, 21 : 77 - 92
  • [16] Scheduling shared continuous resources on many-cores
    Althaus, Ernst
    Brinkmann, Andre
    Kling, Peter
    Heide, Friedhelm Meyer Auf Der
    Nagel, Lars
    Riechers, Soeren
    Sgall, Jiri
    Suess, Tim
    JOURNAL OF SCHEDULING, 2018, 21 (01) : 77 - 92
  • [17] Scheduling Shared Continuous Resources on Many-Cores
    Brinkmann, Andre
    Kling, Peter
    der Heide, Friedhelm Meyer Auf
    Nagel, Lars
    Riechers, Soeren
    Suess, Tim
    PROCEEDINGS OF THE 26TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'14), 2014, : 128 - 137
  • [18] An analytical model for scheduling policies in storage networks
    Hu, Diqing
    Cao, Qiang
    Xie, Changsheng
    NAS: 2006 INTERNATIONAL WORKSHOP ON NETWORKING, ARCHITECTURE, AND STORAGES, PROCEEDINGS, 2006, : 157 - +
  • [19] Efficient Job Scheduling for Clusters with Shared Tiered Storage
    Lackner, Leah E.
    Fard, Hamid Mohammadi
    Wolf, Felix
    2019 19TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID), 2019, : 321 - 330
  • [20] Survey of Scheduling Techniques for Addressing Shared Resources in Multicore Processors
    Zhuravlev, Sergey
    Carlos Saez, Juan
    Blagodurov, Sergey
    Fedorova, Alexandra
    Prieto, Manuel
    ACM COMPUTING SURVEYS, 2012, 45 (01)