Answer-set programming for lexicographical makespan optimisation in parallel machine scheduling

DOI10.1017/S1471068423000017MaRDI QIDQ7027174zbMATH OpenFDO

Authors Thomas Eiter, Tobias Geibinger, Nysret Musliu, Johannes Oetsch, Peter Skočovský, Daria Stepanova

Publication date 14 February 2025

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

parallel machine schedulinganswer-set programminglexicographical optimisation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Knowledge representation (68T30) Logic programming (68N17)

Cites work

• scientific article; zbMATH DE number 5310692 (Why is no real title available?)
• A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
• A note on minimizing the sum of squares of machine completion times on two identical parallel machines
• A survey of scheduling problems with setup times or costs
• ASP-Core-2 input language format
• Answer set programming
• Clingo goes linear constraints over reals and integers
• Constraint Answer Set Solving
• Exact lexicographic scheduling and approximate rescheduling
• Lexicographic bottleneck problems
• Multi-shot ASP solving with clingo
• On Direct Methods for Lexicographic Min-Max Optimization
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
• Relating constraint answer set programming languages and algorithms
• The third comprehensive survey on scheduling problems with setup times/costs
• Train scheduling with hybrid ASP

This page was built for publication: Answer-set programming for lexicographical makespan optimisation in parallel machine scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027174)