Nested partitions for the large-scale extended job shop scheduling problem

被引：0
|
作者：
Hoksung Yau
Leyuan Shi
机构：
[1] JPMorgan Chase,ISyE Department
[2] University of Wisconsin-Madison,Center for Intelligent and Networked Systems
[3] Tsinghua University,undefined
来源：
Annals of Operations Research | 2009年 / 168卷
关键词：
Job shop; Nested partitions; Dispatching rules;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper addresses the large-scale extended job shop scheduling problem while considering the bill of material and the working shifts constraints. We propose two approaches for the problem. One is based on dispatching rules (DR), and the other is an application of the Nested Partitions (NP) Framework. A sampling approach for the exact feasible subregion is developed to complete the NP method. Furthermore, to efficiently search each subregion, a weighted sampling approach is also presented. Computational experiments show that the NP method with weighted sampling can find good solutions for most large-scale extended job shop scheduling problems.
引用
收藏
相关论文
共 50 条
  • [1] Nested partitions for the large-scale extended job shop scheduling problem
    Yau, Hoksung
    Shi, Leyuan
    ANNALS OF OPERATIONS RESEARCH, 2009, 168 (01) : 23 - 39
  • [2] Hybrid Nested Partitions Algorithm for scheduling in job shop problem
    Wu, Wei
    Wei, Junhu
    Guan, Xiaohong
    2009 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND BIOMIMETICS (ROBIO 2009), VOLS 1-4, 2009, : 171 - +
  • [3] A hybrid approach to large-scale job shop scheduling
    Rui Zhang
    Cheng Wu
    Applied Intelligence, 2010, 32 : 47 - 59
  • [4] A hybrid approach to large-scale job shop scheduling
    Zhang, Rui
    Wu, Cheng
    APPLIED INTELLIGENCE, 2010, 32 (01) : 47 - 59
  • [5] Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
    Drotos, Marton
    Erdos, Gabor
    Kis, Tamas
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (01) : 296 - 306
  • [6] An Effective Neighborhood Solution Clipping Method for Large-Scale Job Shop Scheduling Problem
    Wang, Sihan
    Li, Xinyu
    Liu, Qihao
    CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES, 2023, 137 (02): : 1871 - 1890
  • [7] AN APPROACH TO JOB SHOP SCHEDULING USING A LARGE-SCALE COMPUTER
    EMERY, JC
    IMR-INDUSTRIAL MANAGEMENT REVIEW, 1961, 3 (01): : 78 - 96
  • [8] Minimizing Lmax for large-scale, job-shop scheduling problems
    Schultz, SR
    Hodgson, TJ
    King, RE
    Thoney, KA
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (23) : 4893 - 4907
  • [9] Multi-bottleneck scheduling algorithm for large-scale Job Shop
    Key Lab. of Contemporary Design and Integrated Manufacturing Technology, Ministry of Education, Northwestern Polytechnical University, Xi'an 710072, China
    Jisuanji Jicheng Zhizao Xitong, 7 (1486-1494):
  • [10] Declarative Decomposition and Dispatching for Large-Scale Job-Shop Scheduling
    Da Col, Giacomo
    Teppan, Erich C.
    KI 2016: Advances in Artificial Intelligence, 2016, 9904 : 134 - 140
12345