,
Emilio Gamba
,
Lucas Kletzander
,
Tias Guns
Creative Commons Attribution 4.0 International license
High Mix Low Volume (HMLV) assembly problems involve producing a variety of items in small quantities, each of which requires scheduling a sequence of actions performed by machines or human operators. For the production process, companies are increasingly adopting reconfigurable manufacturing systems (RMS) where they choose which machines to deploy. Importantly, the selection of machines can substantially influence overall production time. For this reason, we present a CP model for solving HMLV for RMS. However, solely minimizing makespan does not necessarily yield the most desirable solution from a managerial perspective. For example, it may heavily rely on human operators. Since determining preferred solutions is challenging, incorporating Decision Maker (DM) feedback becomes essential. Therefore, to support DMs in selecting solutions that better reflect their preferences, we adapt pairwise preference elicitation methods for this industrial multi-objective combinatorial problem, while also comparing with trade-off-based methods.
@InProceedings{foschini_et_al:LIPIcs.CP.2026.25,
author = {Foschini, Marco and Gamba, Emilio and Kletzander, Lucas and Guns, Tias},
title = {{From CP Modeling to Preference Elicitation in HMLV Assembly Problems}},
booktitle = {32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)},
pages = {25:1--25:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-432-1},
ISSN = {1868-8969},
year = {2026},
volume = {379},
editor = {Beldiceanu, Nicolas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.25},
URN = {urn:nbn:de:0030-drops-266579},
doi = {10.4230/LIPIcs.CP.2026.25},
annote = {Keywords: Job Shop Scheduling Problem, Multi-objective, Preference Elicitation}
}