Flow-shop problems with intermediate buffers

DOI10.1007/s00291-003-0133-7zbMath1042.90016OpenAlexW2067701099MaRDI QIDQ1412168

Silvia Heitmann, Peter Brucker, Johann L. Hurink

Publication date: 9 November 2003

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/flowshop-problems-with-intermediate-buffers(90f183dd-9ce1-4392-846d-0b34631316ce).html

zbMATH Keywords

Tabu searchBufferFlow-shop problem

Mathematics Subject Classification ID

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

Related Items

Job-shop scheduling with limited capacity buffers ⋮ On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ Simple heuristics for scheduling with limited intermediate storage ⋮ An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations ⋮ Flow shop scheduling with heterogeneous workers ⋮ An effective hybrid genetic algorithm for flow shop scheduling with limited buffers ⋮ An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers ⋮ Complexity of single machine scheduling subject to nonnegative inventory constraints ⋮ Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem ⋮ A note of using effective immune based approach for the flow shop scheduling with buffers