Pages that link to "Item:Q835634"
From MaRDI portal
The following pages link to A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634):
Displaying 14 items.
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan (Q342431) (← links)
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups (Q1296704) (← links)
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities (Q1652634) (← links)
- A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
- A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times (Q2432854) (← links)
- A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times (Q2471235) (← links)
- A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage (Q4973250) (← links)
- A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times (Q5943566) (← links)
- Tabu search for a class of single-machine scheduling problems (Q5945325) (← links)