A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.

DOI10.1016/S0377-2217(02)00873-1zbMath1045.90035MaRDI QIDQ1427559

Bagas Wardono, Yahya Fathi

Publication date: 14 March 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Flowshop schedulingParallel machinesBuffer constraintsMinimizing makespan

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (25)

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case ⋮ Simple heuristics for scheduling with limited intermediate storage ⋮ Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines ⋮ Hybrid variable neighborhood search for automated warehouse scheduling ⋮ 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 ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ A memetic algorithm for the flexible flow line scheduling problem with processor blocking ⋮ 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 ⋮ Hybrid flowshop scheduling with machine and resource-dependent processing times ⋮ Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion ⋮ A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints ⋮ An effective hybrid genetic algorithm for flow shop scheduling with limited buffers ⋮ A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains ⋮ The hybrid flow shop scheduling problem ⋮ Capacity-filtering algorithms for finite-capacity planning of a flexible flow line ⋮ A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time ⋮ Conceptual framework for lot-sizing and scheduling of flexible flow lines ⋮ Identification and robustness analysis of nonlinear multi-stage enzyme-catalytic dynamical system in batch culture ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines ⋮ A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD ⋮ A note of using effective immune based approach for the flow shop scheduling with buffers

Cites Work

• A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
• The flow shop with parallel machines: A tabu search approach
• The permutation flow shop with buffers: A tabu search approach
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Scheduling flexible flow lines with no in-process buffers

This page was built for publication: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.