The paper is concerned with the two-machine flow shop, where each job requires an additional resource (referred to as storage space) from the start of its first operation till the end of its second operation. The storage requirement of a job is determined by the processing time of its first operation. At any point in time, the total consumption of this additional resource cannot exceed a given limit (referred to as the storage capacity). The goal is to minimise the makespan, i.e. to minimise the time needed for the completion of all jobs. This problem is NP-hard in the strong sense. The paper analyses how the parameter - a lower bound on the storage capacity specified in terms of the processing times, affects the computational complexity.
Models, constructive heuristics, and benchmark instances for the flexible job shop scheduling problem with sequencing flexibility and position-based learning effect
Scheduling and Routing in the Flexible Job Shop with Heterogeneous Transbots and Zoning: A Constraint Programming Approach
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology(佐治亚理工学院 H. 米尔顿·斯图尔特工业与系统工程学校);Department of Operations and Decision Systems, Université Laval(拉瓦尔大学运营与决策系统系)
Deep Reinforcement Learning for Flexible Job Shop Scheduling with Random Job Arrivals
Centre for Artificial Intelligence, Zurich University of Applied Sciences(人工智能中心,苏黎世应用科学大学);Inspire AG(Inspire公司);Automatic Control Laboratory, ETH Zurich(自动控制实验室,苏黎世联邦理工学院)
Instance Configuration for Sustainable Job Shop Scheduling
Universitat Politècnica de València(巴塞罗那理工大学);valgrAI - Valencian Graduate School and Research Network of Artificial Intelligence(瓦伦西亚人工智能研究生学院和研究网络);Research Network of Artificial Intelligence(人工智能研究网络)
Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems
Eindhoven University of Technology(埃因霍温理工大学);Eindhoven Artificial Intelligence Systems Institute(埃因霍温人工智能系统研究所);Delmia R&D, Dassault Systèmes(达索系统Delmia研发部)