An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine

DOI10.1007/978-3-030-16711-0_4zbMath1525.90207OpenAlexW2938483102MaRDI QIDQ6084515

Hoang Thanh Le, Philine Geser, Martin Middendorf

Publication date: 1 December 2023

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-16711-0_4

zbMATH Keywords

iterated local searchNEH heuristicpermutation schedulesflow shops with buffers

Mathematics Subject Classification ID

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

Related Items (1)

A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements

Cites Work

• New hard benchmark for flowshop scheduling problems minimising makespan
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
• A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• A note of using effective immune based approach for the flow shop scheduling with buffers
• A genetic algorithm for flowshop sequencing
• Flow-shop problems with intermediate buffers
• Permutation schedules for a two-machine flow shop with storage
• Benchmarks for basic scheduling problems
• An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
• Complexity of flowshop scheduling problems with a new blocking constraint
• Optimal two- and three-stage production schedules with setup times included
• Flowshop scheduling with limited temporary storage
• Ordonnancements à contraintes disjonctives
• The variable neighborhood search for the two machine flow shop problem with a passive prefetch

This page was built for publication: An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine