The following pages link to Pierre Dejax (Q872237):
Displaying 16 items.
- (Q342115) (redirect page) (← links)
- A 2-stage method for a field service routing problem with stochastic travel and service times (Q342116) (← links)
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
- Models for multimode multicommodity location problems with interdepot balancing requirements (Q920012) (← links)
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal (Q1339130) (← links)
- A large neighborhood search heuristic for supply chain network design (Q1652183) (← links)
- Erratum to: ``Approximating the length of Chinese postman tours'' (Q1680766) (← links)
- Exact and hybrid methods for the multiperiod field service routing problem (Q1788906) (← links)
- A branch-and-bound method for multicommodity location with balancing requirements (Q1804068) (← links)
- Approximating the length of Chinese postman tours (Q2257098) (← links)
- An integrated approach for modeling and solving the scheduling problem of container handling systems (Q2508124) (← links)
- Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard (Q2783826) (← links)
- Une heuristique pour le problème d’ordonnancement de type $n/m//F/C_{\text{max}}$ avec la présence de machines goulots (Q3197611) (← links)
- (Q3411724) (← links)
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems (Q4651933) (← links)
- Dynamic and Stochastic Models for the Allocation of Empty Containers (Q5288143) (← links)
