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
来源
关键词
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 条
  • [21] An Extended Flexible Job Shop Scheduling Problem with Parallel Operations
    Lunardi, Willian Tessaro
    Voos, Holger
    APPLIED COMPUTING REVIEW, 2018, 18 (02): : 46 - 56
  • [22] Bottleneck Identification of Extended Flexible Job Shop Scheduling Problem
    Wang, Yunfei
    Tang, Luohao
    Zhou, Yun
    Zhu, Cheng
    Zhang, Weiming
    Yu, Lianfei
    2018 6TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL AND BUSINESS INTELLIGENCE (ISCBI 2018), 2018, : 23 - 27
  • [23] A Hybrid Nested Partitions Algorithm combing with Genetic Algorithm for Job Shop Flexible Resource Scheduling
    Ding Wanning
    Jiao Hongqiang
    Chen Zhuoyi
    MATERIALS SCIENCE AND ENGINEERING, PTS 1-2, 2011, 179-180 : 920 - +
  • [24] STRATEGY: A Flexible Job-Shop Scheduling System for Large-Scale Complex Products
    Liang, Zhiyu
    Wang, Hongzhi
    Yang, Jijia
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2020), PT III, 2020, 12114 : 766 - 770
  • [25] An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
    Gu, Manzhan
    Lu, Xiwen
    Gu, Jinwei
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) : 473 - 495
  • [26] Genetic Programming With Lexicase Selection for Large-Scale Dynamic Flexible Job Shop Scheduling
    Xu, Meng
    Mei, Yi
    Zhang, Fangfang
    Zhang, Mengjie
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2024, 28 (05) : 1235 - 1249
  • [27] An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
    Manzhan Gu
    Xiwen Lu
    Jinwei Gu
    Journal of Combinatorial Optimization, 2017, 33 : 473 - 495
  • [28] Operation Decomposition and Statistical Bottleneck Machine Identification for Large-scale Job Shop Scheduling
    Zhang, Rui
    Wu, Cheng
    2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11, 2008, : 153 - 158
  • [29] A heuristic approach for large scale job shop scheduling problems
    Department of Industrial Engineering, Amirkabir University of Technology, P.O. Box 15875-4413, Tehran, Iran
    J. Appl. Sci., 2008, 6 (992-999):
  • [30] An End-to-end Hierarchical Reinforcement Learning Framework for Large-scale Dynamic Flexible Job-shop Scheduling Problem
    Lei, Kun
    Guo, Peng
    Wang, Yi
    Xiong, Jianyu
    Zhao, Wenchao
    2022 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2022,