A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion

DOI10.3390/a12050100zbMath1461.90050OpenAlexW2945158825WikidataQ127891877 ScholiaQ127891877MaRDI QIDQ2004870

Damla Kizilay, Mehmet Fatih Tasgetiren, Liang Gao, Quan-ke Pan

Publication date: 7 October 2020

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a12050100

zbMATH Keywords

heuristic optimizationmixed integer programmingconstraint programmingflow shop schedulingiterated greedy algorithmblock insertion heuristic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Iterative beam search algorithms for the permutation flowshop ⋮ Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm ⋮ Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem

Cites Work

• New hard benchmark for flowshop scheduling problems minimising makespan
• Carbon-efficient scheduling of flow shops by multi-objective optimization
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
• 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
• Local search methods for the flowshop scheduling problem with flowtime minimization
• An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
• Benchmarks for basic scheduling problems
• Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Optimal two- and three-stage production schedules with setup times included
• The Complexity of Flowshop and Jobshop Scheduling
• Scheduling

This page was built for publication: A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion