Доклад
2019
On Scheduling Problems with Forbidden Stack-Overflows
F. Werner, E. Gafarov · Manufacturing Modelling, Management and Control-9th MIM 2019, Berlin 2019
Описание публикации
In this paper, we consider some special resource-constrained scheduling problems, which occur e.g. in production or in computer science. We consider the minimization of the
makespan as well as total tardiness. Some complexity and approximability results are given as well as relationships to other scheduling problems.
F. Werner, E. Gafarov, On Scheduling Problems with Forbidden Stack-Overflows / Manufacturing Modelling, Management and Control - 9th MIM 2019, Berlin 2019
Другие статьи
2022
On lower and upper bounds for single machine parallel batch scheduling subject to chains of jobs
E.R. Gafarov, A. Dolgui
Optimization Letters
2020
Minimizing Total Weighted Tardiness for Scheduling Equal-Length Jobs on a Single Machine
E.R. Gafarov, A.A. Lazarev, F. Werner
Automation and Remote Control Volume 81, Issue 5, 853-868
2019
Can a Branch and Bound algorithm solve all instances of SALBP-1 efficiently
A. Dolgui, E. Gafarov
IFAC-PapersOnLine, Volume 52, Issue 13. 2788-2791