Pages that link to "Item:Q1413924"
From MaRDI portal
The following pages link to Approximative procedures for no-wait job shop scheduling. (Q1413924):
Displayed 12 items.
- Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
- A heuristic to schedule flexible job-shop in a glass factory (Q1772853) (← links)
- Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266) (← links)
- A memetic algorithm for the job-shop with time-lags (Q2468490) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) (← links)
- An evolutionary approach to rehabilitation patient scheduling: A case study (Q2482797) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
- A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups (Q2642312) (← links)
- Model formulations for the machine scheduling problem with limited waiting time constraints (Q3429070) (← links)
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (Q3605449) (← links)