The maximum length car sequencing problem
Year of publication: |
2024
|
---|---|
Authors: | Pontes, Lara ; Neves, Carlos ; Subramanian, Anand ; Battarra, Maria |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 316.2024, 2 (16.7.), p. 707-717
|
Subject: | Scheduling | Combinatorial optimization | Assembly line | Car sequencing | Scheduling-Verfahren | Scheduling problem | Fließfertigung | Assembly-line production | Theorie | Theory | Kfz-Industrie | Automotive industry | Kraftfahrzeug | Motor vehicle | Produktionssteuerung | Production control |
-
Mixed-model sequencing versus car sequencing : comparison of feasible solution spaces
Louis, Adèle, (2023)
-
Car sequencing versus mixed-model sequencing : a computational study
Golle, Uli, (2014)
-
Car sequencing is NP-hard : a short proof
Estellon, B., (2013)
- More ...
-
Exact algorithms for the traveling salesman problem with draft limits
Battarra, Maria, (2014)
-
Subramanian, Anand, (2014)
-
Exact algorithms for the traveling salesman problem with draft limits
Battarra, Maria, (2014)
- More ...