Constraint-based Scheduling for Paint Shops in the Automotive Supply Industry
|
PaperID: 361
poster
|
|
| Factories in the automotive supply industry paint a large number of items requested by car manufacturing companies on a daily basis. As these factories face numerous constraints and optimization objectives, finding a good schedule becomes a challenging task in practice, and full-time employees are expected to manually create feasible production plans. In this study, we propose novel constraint programming models for a real-life paint shop scheduling problem. We evaluate and compare our models experimentally by performing a series of benchmark experiments using real-life instances in the industry. We also show that the decision variant of the paint shop scheduling problem is NP-complete. | |
Session 2: Scheduling
Automated Production Scheduling for Artificial Teeth Manufacturing
Authors: Felix Winter, Christoph Mrkvicka, Nysret Musliu and Jakob Preininger
Keywords:
machine schedulingmetaheuristicsconstraint programming
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
Authors: Tytus Pikies, Krzysztof Turowski and Marek Kubale
Keywords:
job schedulinguniform machinesmakespantotal completion timeapproximation schemesNP-hardnessincompatibility graph
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
Authors: Klaus Jansen, Alexandra Lassota, Marten Maack and Tytus Pikies
Keywords:
identical machinesunrelated machinestotal completion timeschedulingbagscliquesFPTn-fold IP
Constraint-based Scheduling for Paint Shops in the Automotive Supply Industry
Authors: Felix Winter and Nysret Musliu