On the flexibility of a decision theory-based heuristic for single machine scheduling
| Year of publication: |
January 2019
|
|---|---|
| Authors: | Gahm, Christian ; Kanet, John J. ; Tuma, Axel |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 101.2019, p. 103-115
|
| Subject: | Sequencing | Single machine | Decision theory | Priority dispatching | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Entscheidungstheorie | Durchlaufzeit | Lead time | Algorithmus | Algorithm |
-
Single machine scheduling problems with generalised due-dates and job-rejection
Gerstl, Enrique, (2017)
-
Subramanian, Anand, (2014)
-
A binary search algorithm for the general coupled task scheduling problem
Khatami, Mostafa, (2021)
- More ...
-
Serial- and hierarchical-batch scheduling : a systematic review and future research directions
Wahl, Stefan, (2025)
-
Gahm, Christian, (2022)
-
Machine Learning based Algorithm Selection and Genetic Algorithms for serial-batch scheduling
Uzunoglu, Aykut, (2025)
- More ...