Pages that link to "Item:Q1610144"
From MaRDI portal
The following pages link to The permutation flow shop with buffers: A tabu search approach (Q1610144):
Displayed 36 items.
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
- A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem (Q613548) (← links)
- A unified framework for population-based metaheuristics (Q646652) (← links)
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122) (← links)
- Job-shop scheduling with limited capacity buffers (Q850665) (← links)
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers (Q955624) (← links)
- Complexity of single machine scheduling subject to nonnegative inventory constraints (Q992655) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- A note of using effective immune based approach for the flow shop scheduling with buffers (Q1045843) (← links)
- A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. (Q1410327) (← links)
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. (Q1427559) (← links)
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
- Scheduling of continuous and discontinuous material flows with intermediate storage restrictions (Q1772851) (← links)
- Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
- Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion (Q2003413) (← links)
- Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
- Cyclic flow-shop scheduling with no-wait constraints and missing operations (Q2140312) (← links)
- A sequencing approach for creating new train timetables (Q2267382) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
- A disjunctive graph model and framework for constructing new train schedules (Q2379528) (← links)
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249) (← links)
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (Q2475841) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers (Q2489134) (← links)
- Complexity of flowshop scheduling problems with a new blocking constraint (Q2572855) (← links)
- A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs (Q2637353) (← links)
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers (Q3596695) (← links)
- Sequencing Mixed-Model Assembly Lines with Limited Intermediate Buffers by a GA/SA-Based Algorithm (Q3602003) (← links)
- A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE (Q3638708) (← links)
- Multicriteria scheduling using fuzzy theory and tabu search (Q4807191) (← links)
- Influence of capacity- and time-constrained intermediate storage in two-stage food production systems (Q5426586) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)