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
Distributed Scheduling Problems in Intelligent Manufacturing Systems
TL;DR: The achievements and current research status in this field are analyzed, particularly swarm intelligence and evolutionary algorithms, which are used for managing distributed scheduling problems in manufacturing systems are discussed and future research directions are pointed out.
154
A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times
TL;DR: A machine position-based mathematical model and a discrete artificial bee colony algorithm (DABC) for the DHFSP-SDST to optimise the makespan and results and statistical analyses validate that the DABC outperforms the best performing algorithm in the literature.
97
Decomposition-Based Multi-Objective Optimization for Energy-Aware Distributed Hybrid Flow Shop Scheduling with Multiprocessor Tasks
TL;DR: A mixed inter linear programming model and a Novel MultiObjective Evolutionary Algorithm based on Decomposition (NMOEA/D) are presented and proposed to address the Energy-Aware Distributed Hybrid Flow Shop Scheduling Problem with Multiprocessor Tasks.
95
Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times
TL;DR: In this article , three mixed-integer linear programming (MILP) models and a constraint programming (CP) model are formulated for distributed hybrid flow shop scheduling with sequence-dependent setup times (DHFSP-SDST).
92
Solving energy-efficient distributed job shop scheduling via multi-objective evolutionary algorithm with decomposition
TL;DR: A mathematical model is presented and an effective modified multi-objective evolutionary algorithm with decomposition (MMOEA/D) is proposed, which outperforms other algorithms in the energy-efficient distributed job shop scheduling problem.
92
References
Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions
TL;DR: An energy-aware multi-objective optimization algorithm for solving the hybrid flow shop (HFS) scheduling problem with consideration of the setup energy consumptions with the highly effective proposed EA-MOA algorithm compared with several efficient algorithms from the literature.
284
Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem
TL;DR: A comprehensive computational campaign against the closely related and well performing algorithms in the literature is carried out and the results show that both the presented constructive heuristics and metaheuristics are very effective for solving the DPFSP with total flowtime criterion.
250
Mixed Integer Programming models for job shop scheduling
Wen-Yang Ku,J. Christopher Beck +1 more
TL;DR: The disjunctive MIP model is most efficient, and MIP is efficient for solving moderate-size problems, while constraint programming is compared to constraint programming and the best known algorithm to provide a broad view among different approaches.
218
Solving the flexible job shop scheduling problem with sequence-dependent setup times
TL;DR: A mathematical model which can solve small instances to optimality, and also serves as a problem representation is presented, and a tabu search algorithm with specific neighborhood functions and a diversification structure is developed.
205
Evaluation of mathematical models for flexible job-shop scheduling problems
Yunus Demir,S. Kürşat İşleyen +1 more
TL;DR: Four the most widely used formulations of the FJSP are compiled from literature and a time-indexed model for FJ SP is proposed and results are presented.
200