Journal Article10.1016/J.CIE.2020.106347
Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem
213
TL;DR: The results show that the sequence-based MILP model is the most efficient one, and the proposed CP model is effective in finding good quality solutions for the both the small-sized and large-sized instances.
read more
About: This article is published in Computers & Industrial Engineering. The article was published on 01 Apr 2020. The article focuses on the topics: Constraint programming & Job shop scheduling.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Operating room scheduling by emphasising human factors and dynamic decision-making styles: a constraint programming method
TL;DR: In this article , a multi-objective mixed-integer programming model for daily OR scheduling of inpatient surgeries is investigated, where one of the objectives is to increase the compatibility of surgical team members by considering their primary and backup decision-making styles.
A biogeography-based optimization algorithm with modified migration operator for large-scale distributed scheduling with transportation time
Yaya Zhang,Xingsheng Gu +1 more
TL;DR: In this article , a Biogeography-Based Optimization with Modified Migration Operator (BBO-MMO) is proposed to address the heterogeneous DSP with transportation time between factories at adjacent processing stages, which improves the migration operator by modifying the immigration rate according to processing time and transportation time.
Resource-Constrained Parallel Machine Scheduling for Tire Manufacturing
Hong-Yeon Kim,Woo-Jin Shin,Sanghyun Joo,Hyun-Jung Kim +3 more
- 17 Aug 2025
TL;DR: This study optimizes tire manufacturing scheduling, focusing on tread production, using a resource-constrained parallel machine scheduling problem with the goal of minimizing total tardiness and setup time, proposing an iterated greedy algorithm with the block-split method.
MILP Modeling and Optimization of Three-Stage Flexible Job Shop Scheduling Problem with Assembly and AGV Transportation
Shiming Yang,Saif Ullah +1 more
Mathematical model and discrete artificial Bee Colony algorithm for distributed integrated process planning and scheduling
TL;DR: Wang et al. as mentioned in this paper proposed a discrete artificial bee colony algorithm (DABC) to solve the DIPPS problem, which can guarantee the feasibility of individuals via specially designed mapping and switching operations, so that the process precedence constraints contained by the network graph can be satisfied in the entire procedure of the DABC algorithm.
References
Routing and scheduling in a flexible job shop by tabu search
TL;DR: A hierarchical algorithm for the flexible job shop scheduling problem is described, based on the tabu search metaheuristic, which allows to adapt the same basic algorithm to different objective functions.
1.1K
On the Job-Shop Scheduling Problem
TL;DR: This formulation of discrete linear programming seems, however, to involve considerably fewer variables than two other recent proposals and on these grounds may be worth some computer experimentation.
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
Vipul Jain,Ignacio E. Grossmann +1 more
TL;DR: The goal of this paper is to develop models and methods that use complementary strengths of Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) techniques to solve problems that are otherwise intractable if solved using either of the two methods.
Mathematical modeling and heuristic approaches to flexible job shop scheduling problems
TL;DR: A mathematical model and heuristic approaches for flexible job shop scheduling problems (FJSP) are considered and it is concluded that the hierarchical algorithms have better performance than integrated algorithms and the algorithm which use tabu search and simulated annealing heuristics for assignment and sequencing problems consecutively is more suitable than the other algorithms.
415
A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times
Eva Vallada,Rubén Ruiz +1 more
TL;DR: After an exhaustive computational and statistical analysis it can be concluded that the proposed method shows an excellent performance overcoming the rest of the evaluated methods in a comprehensive benchmark set of instances.
404