Pages that link to "Item:Q2471235"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times (Q2471235):
Displaying 12 items.
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634) (← links)
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
- A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints (Q1572969) (← links)
- Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
- An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← links)
- A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
- Stochastic single machine scheduling problem as a multi-stage dynamic random decision process (Q2051165) (← links)
- An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
- Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← links)
- On path ranking in time-dependent graphs (Q2669544) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
