Pages that link to "Item:Q1317529"
From MaRDI portal
The following pages link to Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529):
Displayed 17 items.
- A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- Multi-resource shop scheduling with resource flexibility (Q1296087) (← links)
- A new tabu search procedure for an audit-scheduling problem (Q1297694) (← links)
- A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods (Q1374387) (← links)
- Tabu-search for the multi-mode job-shop problem (Q1384220) (← links)
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744) (← links)
- Tabu search for resource-constrained scheduling (Q1609891) (← links)
- A heuristic to schedule flexible job-shop in a glass factory (Q1772853) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Effective neighbourhood functions for the flexible job shop problem (Q1976516) (← links)
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem (Q2427185) (← links)
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems (Q2475846) (← links)
- A genetic algorithm for the flexible job-shop scheduling problem (Q2482369) (← links)
- Flexible job-shop scheduling problem under resource constraints (Q5478847) (← links)
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lags (Q5946822) (← links)
- Algorithmical approaches to business process design (Q5955965) (← links)