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
Modeling realistic hybrid flexible flowshop scheduling problems
TL;DR: This paper proposes a formulation along with a mixed integer modelization and some heuristics for the problem of scheduling n jobs on m stages where at each stage the authors have a known number of unrelated machines and identifies the constraints that increase the difficulty.
187
MILP models for energy-aware flexible job shop scheduling problem
TL;DR: Six new mixed integer linear programming (MILP) models with turning Off/On strategy are proposed based on two different modeling ideas namely idle time variable and idle energy variable to help the enterprises rationalize production so as to reduce energy consumption and costs.
183
An adaptive genetic algorithm with dominated genes for distributed scheduling problems
TL;DR: A new crossover mechanism named dominated gene crossover will be introduced to enhance the performance of genetic search, and eliminate the problem of determining optimal crossover rate in multi-factory and multi-product environment.
162
A Three-Stage Multiobjective Approach Based on Decomposition for an Energy-Efficient Hybrid Flow Shop Scheduling Problem
TL;DR: This paper investigates an energy-efficient hybrid flowshop scheduling problem with the consideration of machines with different energy usage ratios, sequence-dependent setups, and machine-to-machine transportation operations with a three-stage multiobjective approach based on decomposition (TMOA/D).
148
Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach
TL;DR: A genetic algorithm with dominant genes (GADG) approach to deal with distributed flexible manufacturing system (FMS) scheduling problems subject to machine maintenance constraint is proposed.