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 | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory |
-
Scheduling unit-length jobs with precedence constraints of small height
Berger, André, (2014)
-
Scheduling with jobs at fixed positions
Jaehn, Florian, (2024)
-
Parallel machine scheduling problem with preemptive jobs and transportation delay
Shams, Hesam, (2014)
- More ...
-
A linear time approximation scheme for makespan minimization in an open shop with release dates
Kononov, Alexander, (2002)
-
Complexity and approximability of scheduling resumable proportionally deteriorating jobs
Gawiejnowicz, Stanislaw, (2010)
-
Post-objective determination of weights of the evaluation factors in public procurement tenders
Gawiejnowicz, Stanisław, (2010)
- More ...