The permutation flow shop with buffers: A tabu search approach
From MaRDI portal
Publication:1610144
DOI10.1016/S0377-2217(98)00017-4zbMath1009.90039MaRDI QIDQ1610144
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Multicriteria scheduling using fuzzy theory and tabu search, Influence of capacity- and time-constrained intermediate storage in two-stage food production systems, Flowshop-scheduling problems with makespan criterion: a review, A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem, A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking, Job-shop scheduling with limited capacity buffers, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, 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, Complexity of single machine scheduling subject to nonnegative inventory constraints, 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, A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage., A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities., Scheduling of continuous and discontinuous material flows with intermediate storage restrictions, Job-shop scheduling with blocking and no-wait constraints, A sequencing approach for creating new train timetables, A disjunctive graph model and framework for constructing new train schedules, Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers, An improved NEH heuristic to minimize makespan in permutation flow shops, An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Complexity of flowshop scheduling problems with a new blocking constraint, 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, A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE
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
