Pages that link to "Item:Q967433"
From MaRDI portal
The following pages link to A new neighborhood and tabu search for the blocking job shop (Q967433):
Displaying 16 items.
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (Q342448) (← links)
- Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots (Q420153) (← links)
- Scheduling coupled-operation jobs with exact time-lags (Q714025) (← links)
- The flexible blocking job shop with transfer and set-up times (Q719021) (← links)
- Group-shop scheduling with sequence-dependent set-up and transportation times (Q1634110) (← links)
- A hybrid metaheuristic algorithm to optimise a real-world robotic cell (Q1652331) (← links)
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraints (Q1743650) (← links)
- Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
- A survey of job shop scheduling problem: the types and models (Q2146994) (← links)
- Efficient primal heuristic updates for the blocking job shop problem (Q2239845) (← links)
- Optimal job insertion in the no-wait job shop (Q2392741) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem (Q2411179) (← links)
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking (Q2423281) (← links)
- A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization (Q4685816) (← links)
- The blocking job shop with rail-bound transportation (Q5963615) (← links)
