Pages that link to "Item:Q1976516"
From MaRDI portal
The following pages link to Effective neighbourhood functions for the flexible job shop problem (Q1976516):
Displayed 18 items.
- Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
- A tabu search approach for scheduling hazmat shipments (Q856786) (← links)
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- A repairing technique for the local search of the job-shop problem. (Q1417509) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- A lower bound for the job insertion problem. (Q1811122) (← links)
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem (Q2427185) (← links)
- Surgical case scheduling as a generalized job shop scheduling problem (Q2464181) (← 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)
- Scheduling unit length jobs with parallel nested machine processing set restrictions (Q2566928) (← links)
- Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems (Q2571190) (← links)
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem (Q3498886) (← links)
- Multi-agent-based workload control for make-to-order manufacturing (Q3533191) (← links)
- Resource allocation algorithm for light communication grid-based workflows within an SLA context (Q3612794) (← links)
- Linguistic-based meta-heuristic optimization model for flexible job shop scheduling (Q4706348) (← links)
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931) (← links)
- Flexible job-shop scheduling problem under resource constraints (Q5478847) (← links)