The permutation flow shop with buffers: A tabu search approach
From MaRDI portal
Publication:1610144
DOI10.1016/S0377-2217(98)00017-4zbMath1009.90039OpenAlexW2114736096MaRDI QIDQ1610144
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00017-4
Related Items
Iterative beam search algorithms for the permutation flowshop ⋮ Cyclic flow-shop scheduling with no-wait constraints and missing operations ⋮ A disjunctive graph model and framework for constructing new train schedules ⋮ Multicriteria scheduling using fuzzy theory and tabu search ⋮ A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs ⋮ Job-shop scheduling with limited capacity buffers ⋮ Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines ⋮ A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem ⋮ A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. ⋮ A unified framework for population-based metaheuristics ⋮ A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion ⋮ An effective hybrid genetic algorithm for flow shop scheduling with limited buffers ⋮ Influence of capacity- and time-constrained intermediate storage in two-stage food production systems ⋮ A sequencing approach for creating new train timetables ⋮ Scheduling of continuous and discontinuous material flows with intermediate storage restrictions ⋮ An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers ⋮ Sequencing Mixed-Model Assembly Lines with Limited Intermediate Buffers by a GA/SA-Based Algorithm ⋮ Complexity of single machine scheduling subject to nonnegative inventory constraints ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ A note of using effective immune based approach for the flow shop scheduling with buffers ⋮ Complexity of flowshop scheduling problems with a new blocking constraint ⋮ Job-shop scheduling with blocking and no-wait constraints ⋮ A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
Uses Software
Cites Work
- On two-machine scheduling with release and due dates to minimize maximum lateness
- A fast tabu search algorithm for the permutation flow-shop problem
- A two-machine permutation flow shop scheduling problem with buffers
- Benchmarks for basic scheduling problems
- Flowshop sequencing problems with limited buffer storage
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- Tabu Search—Part I
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
