Pages that link to "Item:Q932219"
From MaRDI portal
The following pages link to An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem (Q932219):
Displaying 25 items.
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem (Q338852) (← links)
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming (Q657572) (← links)
- Optimization framework for process scheduling of operation-dependent automobile assembly lines (Q691498) (← links)
- A GRASP approach for the extended car sequencing problem (Q835577) (← links)
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem (Q932175) (← links)
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem (Q932211) (← links)
- Two local search approaches for solving real-life car sequencing problems (Q932212) (← links)
- Iterated tabu search for the car sequencing problem (Q932213) (← links)
- A beam search approach for the optimization version of the car sequencing problem (Q940889) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Sequencing mixed-model assembly lines: survey, classification and model critique (Q1011163) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- A column generation approach and new bounds for the car sequencing problem (Q1639282) (← links)
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
- A systematic approach to quality oriented product sequencing for multistage manufacturing systems (Q1793774) (← links)
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
- Stochastic mixed-model assembly line sequencing problem: mathematical modeling and Q-learning based simulated annealing hyper-heuristics (Q2282543) (← links)
- Iterative beam search for car sequencing (Q2341215) (← links)
- Review and comparison of three methods for the solution of the car sequencing problem (Q3370361) (← links)
- Large neighborhood improvements for solving car sequencing problems (Q3534210) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713875) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem (Q6160231) (← links)
