The flow shop with parallel machines: A tabu search approach
From MaRDI portal
Publication:1609888
DOI10.1016/S0377-2217(97)00260-9zbMath0991.90059OpenAlexW2019704988MaRDI QIDQ1609888
Eugeniusz Nowicki, Czesław Smutnicki
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(97)00260-9
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Scheduling flexible flow lines with sequence-dependent setup times, Optimal versus heuristic scheduling of surface mount technology lines, A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, A taxonomy of flexible flow line scheduling procedures, A parallel tabu search for solving the primal buffer allocation problem in serial production systems, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines, Assembly flowshop scheduling problem: speed-up procedure and computational evaluation, Research on m‐machine flow shop scheduling with truncated learning effects, Hybrid flow-shop scheduling problems with multiprocessor task systems., A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities., Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem, Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises, An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation, Two-stage hybrid flow shop with recirculation, A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria, Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines, Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective, A tabu search algorithm for parallel machine total tardiness problem, Multiple machine JIT scheduling: a tabu search approach, The hybrid flow shop scheduling problem, Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments, Metaheuristic algorithms for the hybrid flowshop scheduling problem, An integrated approach for modeling and solving the scheduling problem of container handling systems, Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling, A genetic algorithm for the proportionate multiprocessor open shop, Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, Conceptual framework for lot-sizing and scheduling of flexible flow lines, Modelling multi-stage manufacturing systems for efficient scheduling, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, A review of TSP based approaches for flowshop scheduling, A scheduling problem in the baking industry, The convergence of stochastic algorithms solving flow shop scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Branch and bound algorithm for the flow shop with multiple processors
- Some efficient heuristic methods for the flow shop sequencing problem
- A fast tabu search algorithm for the permutation flow-shop problem
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
- Future paths for integer programming and links to artificial intelligence
- Hashing vectors for tabu search
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Tabu Search—Part I
- Tabu Search—Part II
- The Reactive Tabu Search
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
- Job Shop Scheduling by Local Search
