Pages that link to "Item:Q4697307"
From MaRDI portal
The following pages link to A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) (Q4697307):
Displaying 15 items.
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- A cutting and scheduling problem in float glass manufacturing (Q398905) (← links)
- A hybrid particle swarm optimization approach for the sequential ordering problem (Q622165) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- A heuristic manipulation technique for the sequential ordering problem (Q925838) (← links)
- The application of preprocessing and cutting plane techniques for a class of production planning problems (Q1273528) (← links)
- Local search procedures for improving feasible solutions to the sequential ordering problem (Q1309885) (← links)
- On due-date based valid cuts for the sequential ordering problem (Q1367938) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
- Tree based models and algorithms for the preemptive asymmetric stacker crane problem (Q2907956) (← links)
- A sequential ordering problem in automotive paint shops (Q3159669) (← links)
- A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128) (← links)
- Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
