Daniil Baldouski: An open-shop scheduling problem with operations batching

V ponedeljek, 18. avgusta 2025, bo ob 16:00 uri izvedeno
predavanje v okviru PONEDELJKOVEGA SEMINARJA RAČUNALNIŠTVA IN INFORMATIKE
Oddelkov za Informacijske znanosti in tehnologije UP FAMNIT in UP IAM.

ČAS/PROSTOR: 18. avgust 2025 ob 16.00 prek Zoom-a (https://upr-si.zoom.us/j/297328207?pwd=S3Zpdk1VR3pjckNtWkQwKzlvcDR5UT09).

——————————————–
PREDAVATELJ: Daniil BALDOUSKI
——————————————–

Daniil Baldouski is a third-year PhD student of Computer Science at UP FAMNIT.

———————————————————————————————–
NASLOV: An open-shop scheduling problem with operations batching
———————————————————————————————–

POVZETEK:

This work generalizes the open-shop and batch scheduling problems by considering merging of operations. We propose an efficient two-phase heuristic, which combines a graph-based optimal merging algorithm with a mixed-integer linear programming (MILP) model for the open-shop scheduling part of the problem. We introduce a benchmark instance set to validate our methodology.

Seminar bo potekal v angleškem jeziku.

Seminar bo izveden online prek Zoom-a na sledeči povezavi:

https://upr-si.zoom.us/j/297328207?pwd=S3Zpdk1VR3pjckNtWkQwKzlvcDR5UT09

Meeting ID: 297 328 207
Passcode: 123456789

Vabljeni!

Share with others

Accessibility Toolbar

Privacy Overview

This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.