Pages that link to "Item:Q932214"
From MaRDI portal
The following pages link to Soft car sequencing with colors: lower bounds and optimality proofs (Q932214):
Displaying 13 items.
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (Q398878) (← links)
- On the complexity of the car sequencing problem. (Q703239) (← links)
- A GRASP approach for the extended car sequencing problem (Q835577) (← links)
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem (Q932211) (← links)
- Local search and suffix tree for car-sequencing problem with colors (Q932215) (← links)
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints (Q932216) (← links)
- A column generation approach and new bounds for the car sequencing problem (Q1639282) (← links)
- Advanced constraint propagation for the combined car sequencing and level scheduling problem (Q1782169) (← links)
- Robust car sequencing for automotive assembly (Q2030663) (← links)
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
- Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops (Q2307010) (← links)
- Iterative beam search for car sequencing (Q2341215) (← links)
- Car sequencing versus mixed-model sequencing: a computational study (Q2514809) (← links)
