A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
Year of publication: |
February 2016
|
---|---|
Authors: | Dugarzhapov, Aldar ; Kononov, Alexander |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 19.2016, 1, p. 61-72
|
Subject: | Mixed-shop scheduling | Polynomial-time algorithms | Preemption | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A new combinatorial algorithm for separable convex resource allocation with nested bound constraints
Wu, Zeyang, (2021)
-
Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
Juvin, Carla, (2023)
-
Scheduling unit-length jobs with precedence constraints of small height
Berger, André, (2014)
- More ...
-
Complexity and approximability of scheduling resumable proportionally deteriorating jobs
Gawiejnowicz, Stanisław, (2010)
-
Kononov, Alexander, (2012)
-
A complete 4-parametric complexity classification of short shop scheduling problems
Kononov, Alexander, (2012)
- More ...