4.7 Article

A hybrid genetic tabu search algorithm for distributed flexible job shop scheduling problems

Related references

Note: Only part of the references are listed.
Article Engineering, Industrial

A new neighbourhood structure for job shop scheduling problems

Jin Xie et al.

Summary: This paper focuses on the role of neighbourhood structures in solving the job shop scheduling problem (JSP) and proposes a new N8 neighbourhood structure. Experimental results show that the N8 structure is more effective and efficient in solving JSP compared to other neighbourhood structures.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2023)

Article Engineering, Industrial

Look-ahead based reinforcement learning for robotic flow shop scheduling

Hyun-Jung Kim et al.

Summary: This study addresses the scheduling of a robotic flow shop with a dual-gripper robot using a makespan measure. Previous studies have mainly focused on cyclic scheduling, but noncyclic scheduling is now in high demand for producing customized products efficiently. The study proposes a novel solution approach, called look-ahead based reinforcement learning (LARL), which consists of deep Q-learning and look-ahead search. Experimental results demonstrate the effectiveness of LARL compared to an optimal algorithm and a well-known robot task sequence.

JOURNAL OF MANUFACTURING SYSTEMS (2023)

Article Engineering, Industrial

Flexible job shop scheduling problem under Industry 5.0: A survey on human reintegration, environmental consideration and resilience improvement

Candice Destouet et al.

Summary: The Job Shop Scheduling Problem (JSSP) has been extensively studied, and various approaches have been proposed to support scheduling decisions in evolving production environments. The emergence of Industry 4.0 and now Industry 5.0 has led to more efficient and sustainable production scheduling that takes into account human considerations. Recent literature has highlighted the impact of worker well-being and skills on scheduling performance, as well as the importance of considering environmental factors. This paper introduces the Sustainable Flexible Scheduling Problem (SFJSSP) as a comprehensive model that incorporates human and environmental factors in addition to traditional scheduling considerations.

JOURNAL OF MANUFACTURING SYSTEMS (2023)

Article Automation & Control Systems

A Hyperheuristic With Q-Learning for the Multiobjective Energy-Efficient Distributed Blocking Flow Shop Scheduling Problem

Fuqing Zhao et al.

Summary: This study proposes a hyperheuristic algorithm based on Q-learning to solve the energy-efficient distributed blocking flow shop scheduling problem. By selecting a suitable low-level heuristic algorithm based on historical information feedback, considering both total tardiness and total energy consumption in the initialization method, and designing acceleration and deceleration operations to optimize scheduling performance. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in terms of efficiency and significance in solving this problem.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Computer Science, Artificial Intelligence

Dynamic distributed flexible job-shop scheduling problem considering operation inspection

Kaikai Zhu et al.

Summary: In this paper, a dynamic distributed flexible job-shop scheduling problem considering operation inspection (DFJSPI) is proposed, and a modified memetic algorithm (MMA) is designed to solve it. Extensive experiments comparing the MMA with three other well-known algorithms demonstrate its obvious superiority in almost all tested instances. This study will be beneficial for production managers dealing with dynamical distributed manufacturing with operation inspection, especially providing reference for manufacturing systems with operation reworking and scrapping.

EXPERT SYSTEMS WITH APPLICATIONS (2023)

Article Engineering, Mechanical

Necessary and Sufficient Conditions for Feasible Neighbourhood Solutions in the Local Search of the Job-Shop Scheduling Problem

Lin Gui et al.

Summary: This paper explores the domain knowledge of the job-shop scheduling problem (JSP) and proposes sufficient and necessary constraint conditions to find all feasible neighbourhood solutions, allowing thorough local search. A new neighbourhood structure is designed and a fast calculation method for all feasible neighbourhood solutions is provided. Experimental results show that the calculation method is effective and the new neighbourhood structure outperforms other famous and influential structures.

CHINESE JOURNAL OF MECHANICAL ENGINEERING (2023)

Article Computer Science, Interdisciplinary Applications

Intelligent factory many-objective distributed flexible job shop collaborative scheduling method

Yanwei Sang et al.

Summary: The Ma-ODFJCSP is a significant problem that has not been addressed in the literature, with a large scheduling scale that is difficult to optimize and coordinate. The proposed solution involves a many-objective distributed flexible job shop model and a high-dimensional many-objective memetic algorithm (HMOMA).

COMPUTERS & INDUSTRIAL ENGINEERING (2022)

Article Computer Science, Interdisciplinary Applications

A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers

Chao Lu et al.

Summary: Energy-efficient scheduling of distributed production systems is essential for large companies in the context of economic globalization and green manufacturing. This paper presents a collaborative multi-objective optimization algorithm (CMOA) to address the Distributed Permutation Flow-Shop Problem with Limited Buffers (DPFSP-LB), aiming to minimize makespan and total energy consumption. The experimental results demonstrate the effectiveness of CMOA in solving the energy-efficient DPFSP-LB, achieving competitive results compared to other well-known multi-objective optimization algorithms.

ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING (2022)

Article Automation & Control Systems

Energy-Efficient Scheduling of Distributed Flow Shop With Heterogeneous Factories: A Real-World Case From Automobile Industry in China

Chao Lu et al.

Summary: This study introduces a novel energy-efficient scheduling approach for distributed flow shop machining, using a hybrid multiobjective optimization algorithm that outperformed other state-of-the-art algorithms in real-world experiments.

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS (2021)

Article Computer Science, Artificial Intelligence

An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance

Jia-yang Mao et al.

Summary: This paper studies the distributed permutation flowshop scheduling problem with preventive maintenance operation, proposing a multi-start iterated greedy algorithm to minimize makespan. By improving heuristic methods and introducing destruction and construction phases, it avoids local optima and strengthens the exploitation of local neighborhood solutions.

EXPERT SYSTEMS WITH APPLICATIONS (2021)

Article Computer Science, Artificial Intelligence

A discrete spotted hyena optimizer for solving distributed job shop scheduling problems

Mehmet Akif Sahman

Summary: Scheduling is crucial for manufacturing companies, with job shop scheduling aiming to optimize the sequence of jobs on machines to minimize production time. The distributed job shop scheduling problem (DJSP) becomes more complex with globalization, requiring exact or heuristic solvers. The DSHO algorithm proposed in this study shows promising results as a pioneer solver for DJSP.

APPLIED SOFT COMPUTING (2021)

Article Engineering, Industrial

A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility

Guiliang Gong et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2020)

Article Computer Science, Interdisciplinary Applications

An efficient evolutionary grey wolf optimizer for multi-objective flexible job shop scheduling problem with hierarchical job precedence constraints

Zhenwei Zhu et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2020)

Article Computer Science, Interdisciplinary Applications

Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem

Leilei Meng et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2020)

Article Computer Science, Artificial Intelligence

Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment

Zhongshi Shao et al.

EXPERT SYSTEMS WITH APPLICATIONS (2020)

Article Computer Science, Theory & Methods

An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints

Guohui Zhang et al.

Swarm and Evolutionary Computation (2020)

Article Computer Science, Artificial Intelligence

Discrete evolutionary multi-objective optimization for energy-efficient blocking flow shop scheduling with setup time

Yuyan Han et al.

APPLIED SOFT COMPUTING (2020)

Article Computer Science, Artificial Intelligence

An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem

Yibing Li et al.

APPLIED SOFT COMPUTING (2020)

Article Computer Science, Artificial Intelligence

An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers

Qiang Luo et al.

EXPERT SYSTEMS WITH APPLICATIONS (2020)

Article Computer Science, Artificial Intelligence

Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem

Zhongshi Shao et al.

SWARM AND EVOLUTIONARY COMPUTATION (2020)

Article Computer Science, Artificial Intelligence

A genetic algorithm embedded with a concise chromosome representation for distributed and flexible job-shop scheduling problems

Po-Hsiang Lu et al.

JOURNAL OF INTELLIGENT MANUFACTURING (2018)

Article Computer Science, Interdisciplinary Applications

Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems

Muh-Cherng Wu et al.

COMPUTERS & OPERATIONS RESEARCH (2017)

Article Engineering, Industrial

An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem

Xinyu Li et al.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2016)

Article Computer Science, Interdisciplinary Applications

Genetic tabu search for the fuzzy flexible job shop problem

Juan Jose Palacios et al.

COMPUTERS & OPERATIONS RESEARCH (2015)

Article Computer Science, Artificial Intelligence

Modeling and heuristics for scheduling of distributed job shops

B. Naderi et al.

EXPERT SYSTEMS WITH APPLICATIONS (2014)

Article Engineering, Industrial

A hybrid genetic algorithm and tabu search for a multi-objective dynamic job shop scheduling problem

Liping Zhang et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2013)

Article Computer Science, Interdisciplinary Applications

The distributed permutation flowshop scheduling problem

B. Naderi et al.

COMPUTERS & OPERATIONS RESEARCH (2010)

Article Management

An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem

L. De Giovanni et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)

Article Computer Science, Interdisciplinary Applications

A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem

ChaoYong Zhang et al.

COMPUTERS & OPERATIONS RESEARCH (2007)