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...
Saved in:
Published in | Theory and practice of logic programming Vol. 23; no. 6; pp. 1281 - 1306 |
---|---|
Main Authors | , , , , , |
Format | Journal Article |
Language | English |
Published |
Cambridge
Cambridge University Press
01.11.2023
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!