Pages that link to "Item:Q1427559"
From MaRDI portal
The following pages link to A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. (Q1427559):
Displaying 25 items.
- Hybrid flowshop scheduling with machine and resource-dependent processing times (Q534872) (← links)
- Identification and robustness analysis of nonlinear multi-stage enzyme-catalytic dynamical system in batch culture (Q747200) (← links)
- A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case (Q864823) (← links)
- Simple heuristics for scheduling with limited intermediate storage (Q868994) (← links)
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines (Q878937) (← links)
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
- A memetic algorithm for the flexible flow line scheduling problem with processor blocking (Q954039) (← links)
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers (Q955624) (← links)
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) (← links)
- A note of using effective immune based approach for the flow shop scheduling with buffers (Q1045843) (← links)
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. (Q1427559) (← links)
- A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints (Q1762015) (← links)
- A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time (Q1792653) (← links)
- Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion (Q2003413) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (Q2475841) (← links)
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers (Q2489134) (← links)
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains (Q2491781) (← links)
- Capacity-filtering algorithms for finite-capacity planning of a flexible flow line (Q3055437) (← links)
- A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD (Q3406729) (← links)
- Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem (Q3541175) (← links)
- Conceptual framework for lot-sizing and scheduling of flexible flow lines (Q5466729) (← links)
- Hybrid variable neighborhood search for automated warehouse scheduling (Q6063514) (← links)
