Pages that link to "Item:Q707135"
From MaRDI portal
The following pages link to Tabu search algorithms for job-shop problems with a single transport robot (Q707135):
Displayed 13 items.
- Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots (Q420153) (← links)
- Group-shop scheduling with sequence-dependent set-up and transportation times (Q1634110) (← links)
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times (Q1762161) (← links)
- A simulated multi-objective model for flexible job shop transportation scheduling (Q2150761) (← links)
- Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm (Q2160660) (← links)
- Joint production and transportation scheduling in flexible manufacturing systems (Q2274861) (← links)
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm (Q2284476) (← links)
- The blocking job shop with rail-bound transportation (Q5963615) (← links)
- Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen (Q6068710) (← links)
- Flexible job-shop scheduling with transportation resources (Q6087485) (← links)
- A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources (Q6106766) (← links)