Pages that link to "Item:Q955327"
From MaRDI portal
The following pages link to The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327):
Displaying 15 items.
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (Q320637) (← links)
- The traveling salesman problem with time-dependent service times (Q320683) (← links)
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times (Q337074) (← links)
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- A GRASP based on DE to solve single machine scheduling problem with SDST (Q434179) (← links)
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634) (← links)
- Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)