Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-07T15:25:05.921Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  29 February 2024

THOMAS EITER Open the ORCID record for THOMAS EITER [Opens in a new window] ,
TOBIAS GEIBINGER Open the ORCID record for TOBIAS GEIBINGER [Opens in a new window] ,
NYSRET MUSLIU ,
JOHANNES OETSCH Open the ORCID record for JOHANNES OETSCH [Opens in a new window] ,
PETER SKOČOVSKÝ  and
DARIA STEPANOVA
THOMAS EITER
Affiliation:
Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails: [email protected], [email protected], [email protected], [email protected])
TOBIAS GEIBINGER
Affiliation:
Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails: [email protected], [email protected], [email protected], [email protected])
NYSRET MUSLIU
Affiliation:
Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails: [email protected], [email protected], [email protected], [email protected])
JOHANNES OETSCH
Affiliation:
Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails: [email protected], [email protected], [email protected], [email protected])
PETER SKOČOVSKÝ
Affiliation:
Bosch Center for AI, Robert Bosch Campus 1, D-71272 Renningen, Germany (e-mails: [email protected], [email protected])
DARIA STEPANOVA
Affiliation:
Bosch Center for AI, Robert Bosch Campus 1, D-71272 Renningen, Germany (e-mails: [email protected], [email protected])
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content. As you have access to this content, full HTML content is provided on this page. A PDF of this content is also available in through the ‘Save PDF’ action button.
Type
Addendum
Information
Theory and Practice of Logic Programming , Volume 24 , Issue 2 , March 2024 , pp. 421
Check for updates
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
The Author(s), 2024. Published by Cambridge University Press

The above mentioned article was made retrospectively OA, since original publication. The authors acknowledge TU Wien Bibliothek for financial support through its Open Access Funding Program.

References

Eiter, T., Geibinger, T., Musliu, N., Oetsch, J., Skočovský, P. and Stepanova, D. 2023. Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling. Theory and Practice of Logic Programming, 23, 6, 1281–1306. doi:10.1017/S1471068423000017 CrossRefGoogle Scholar