Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization

DOI10.1080/0305215x.2021.2010727zbMath1523.90216OpenAlexW4200378703MaRDI QIDQ6094862

Qinghua Wu, Shuai Cheng, Weibo Liu, Unnamed Author

Publication date: 10 October 2023

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

Full work available at URL: https://doi.org/10.1080/0305215x.2021.2010727

zbMATH Keywords

makespanheuristicblocking flow shopidle timeblocking time

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• New hard benchmark for flowshop scheduling problems minimising makespan
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• An improved NEH-based heuristic for the permutation flowshop problem
• An empirical analysis of the optimality rate of flow shop heuristics
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
• Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking
• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
• Benchmarks for basic scheduling problems
• An improved NEH heuristic to minimize makespan in permutation flow shops
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem

This page was built for publication: Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization