On the parameterized tractability of the just-in-time flow-shop scheduling problem
Year of publication: |
2019
|
---|---|
Authors: | Hermelin, Danny ; Shabtay, Dvir ; Talmon, Nimrod |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 6, p. 663-676
|
Subject: | Scheduling | Flow-shop | Just-in-time | Parameterized complexity | Fixed-parameter tractability | Scheduling-Verfahren | Scheduling problem | Just in Time | Just in time | Theorie | Theory |
-
Corominas, Albert, (2019)
-
A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence
Gerstl, Enrique, (2023)
-
Self-adaptive biased differential evolution for scheduling against common due dates
Nearchou, Andreas C., (2024)
- More ...
-
Scheduling two agents on a single machine : a parameterized analysis of NP-hard problems
Hermelin, Danny, (2019)
-
On the parameterized tractability of single machine scheduling with rejection
Hermelin, Danny, (2019)
-
Equitable scheduling on a single machine
Heeger, Klaus, (2023)
- More ...