Journal Article10.1109/TSMC.2017.2788879
A Knowledge-Based Cooperative Algorithm for Energy-Efficient Scheduling of Distributed Flow-Shop
Jing-jing Wang,Ling Wang +1 more
239
TL;DR: This paper addresses an energy-efficient scheduling of the distributed permutation flow-shop (EEDPFSP) with the criteria of minimizing both makespan and total energy consumption.
read more
Abstract: Facing increasingly serious ecological problems, sustainable development and green manufacturing have attracted much attention. Meanwhile, with the development of globalization, distributed manufacturing is becoming widespread. This paper addresses an energy-efficient scheduling of the distributed permutation flow-shop (EEDPFSP) with the criteria of minimizing both makespan and total energy consumption. Considering the distributed and multiobjective optimization complexity, a knowledge-based cooperative algorithm (KCA) is proposed to solve the EEDPFSP. First, a cooperative initialization scheme is presented with both extended energy-efficient Nawaz–Enscore–Ham heuristic and slowest allowable speed rule that are specially designed to produce good initial solutions with certain diversity. Second, several properties of the nondominated solutions are investigated based on the characteristics of the bi-objective problem, which are used to develop the knowledge-based search operators. Third, a cooperative search strategy of multiple operators is designed for the solutions with different characteristics to tradeoff two objectives. Fourth, a knowledge-based local intensification is used for exploiting better nondominated solutions sufficiently. Moreover, an energy saving method based on the critical path is used to further improve the performance. The effect of parameter setting on the KCA is investigated with the Taguchi method of design-of-experiment. Extensive computational tests and comparisons are carried out, which verify the effectiveness of the special designs of the KCA in solving the EEDPFSP.
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
•Journal Article
The Design and Analysis of Experiments
TL;DR: This book by a teacher of statistics (as well as a consultant for "experimenters") is a comprehensive study of the philosophical background for the statistical design of experiment.
15.2K
A Two-Stage Cooperative Evolutionary Algorithm With Problem-Specific Knowledge for Energy-Efficient Scheduling of No-Wait Flow-Shop Problem
Fuqing Zhao,Xuan He,Ling Wang +2 more
TL;DR: A two-stage cooperative evolutionary algorithm with problem-specific knowledge called TS-CEA is proposed to address energy-efficient scheduling of the no-wait flow-shop problem (EENWFSP) with the criteria of minimizing both makespan and total energy consumption.
201
An Ensemble Discrete Differential Evolution for the Distributed Blocking Flowshop Scheduling with Minimizing Makespan Criterion
TL;DR: An ensemble discrete differential evolution (EDE) algorithm is proposed to solve the blocking flowshop scheduling problem with the minimization of the makespan in the distributed manufacturing environment.
185
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
Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem
TL;DR: Two algorithms are proposed: DNEH with smallest-medium rule and multi-neighborhood iterated greedy algorithm for solving the DHFSP, which combines the characteristic of distributed flow shop scheduling and parallel machine scheduling.
144
References
A fast and elitist multiobjective genetic algorithm: NSGA-II
TL;DR: This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
•Journal Article
The Design and Analysis of Experiments
TL;DR: This book by a teacher of statistics (as well as a consultant for "experimenters") is a comprehensive study of the philosophical background for the statistical design of experiment.
15.2K
The Complexity of Flowshop and Jobshop Scheduling
TL;DR: The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.
2.6K
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
2.5K
A scheduling model for reduced CPU energy
F. Frances Yao,Alan J. Demers,Scott Shenker +2 more
- 23 Oct 1995
TL;DR: This paper proposes a simple model of job scheduling aimed at capturing some key aspects of energy minimization, and gives an off-line algorithm that computes, for any set of jobs, a minimum-energy schedule.