A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time

DOI10.1080/0305215X.2022.2145605MaRDI QIDQ6495522

Weikang Fang, Zhipeng Chen, Zhengmin Zhang, Lei Yue, Unnamed Author, Zailin Guan

Publication date: 30 April 2024

Published in: Engineering Optimization (Search for Journal in Brave)

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Scatter search with path relinking for the flexible job shop scheduling problem
• Heuristic approaches for scheduling jobs in large-scale flexible job shops
• An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
• A fluid approach to large volume job shop scheduling
• Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan
• A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
• Optimization of setup times in the furniture industry
• Effective neighbourhood functions for the flexible job shop problem
• Routing and scheduling in a flexible job shop by tabu search
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• A genetic algorithm for the flexible job-shop scheduling problem
• A hybrid genetic algorithm for the job shop scheduling problem
• A survey of adaptive large neighborhood search algorithms and applications
• A research survey: review of flexible job shop scheduling techniques
• A Fluid Heuristic for Minimizing Makespan in Job Shops
• From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
• Tabu Search—Part II
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• Scheduling jobshops with some identical or similar jobs
• Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule

This page was built for publication: A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time