Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling

We deal with a challenging scheduling problem on parallel machines with sequence-dependent setup times and release dates from a real-world application of semiconductor work-shop production. There, jobs can only be processed by dedicated machines, thus few machines can determine the makespan almost r...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theory and practice of logic programming Ročník 23; číslo 6; s. 1281 - 1306
Hlavní autoři: EITER, THOMAS, GEIBINGER, TOBIAS, MUSLIU, NYSRET, OETSCH, JOHANNES, SKOČOVSKÝ, PETER, STEPANOVA, DARIA
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cambridge Cambridge University Press 01.11.2023
Témata:
Algorithms
answer-set programming
Constraint modelling
Employment
Integer programming
Knowledge representation
lexicographical optimisation
Linear programming
Mixed integer
parallel machine scheduling
Release dates
Schedules
Scheduling
Subject specialists
Variables
ISSN:1471-0684, 1475-3081, 1475-3081
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We deal with a challenging scheduling problem on parallel machines with sequence-dependent setup times and release dates from a real-world application of semiconductor work-shop production. There, jobs can only be processed by dedicated machines, thus few machines can determine the makespan almost regardless of how jobs are scheduled on the remaining ones. This causes problems when machines fail and jobs need to be rescheduled. Instead of optimising only the makespan, we put the individual machine spans in non-ascending order and lexicographically minimise the resulting tuples. This achieves that all machines complete as early as possible and increases the robustness of the schedule. We study the application of answer-set programming (ASP) to solve this problem. While ASP eases modelling, the combination of timing constraints and the considered objective function challenges current solving technology. The former issue is addressed by using an extension of ASP by difference logic. For the latter, we devise different algorithms that use multi-shot solving. To tackle industrial-sized instances, we study different approximations and heuristics. Our experimental results show that ASP is indeed a promising knowledge representation and reasoning (KRR) paradigm for this problem and is competitive with state-of-the-art constraint programming (CP) and Mixed-Integer Programming (MIP) solvers.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1471-0684
1475-3081
1475-3081
DOI:10.1017/S1471068423000017