A Book of Open Shop Scheduling : Algorithms, Complexity and Applications
Year of publication: |
2022
|
---|---|
Authors: | Kubiak, Wieslaw |
Publisher: |
2022.: Cham : Springer International Publishing 2022.: Cham : Imprint: Springer |
Subject: | open shops | complexity | algorithms | approximation | NP-hardness | inapproximability | edge coloring | multiprocessor operations | timetabling | compact schedules | wireless networks | concurrent open shops | time lags | no-wait schedules | proportionate open shops | integer linear programming | network flows | bipartite graphs | simultaneity constraints | deficiency | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
Extent: | 1 Online-Ressource (XIX, 277 Seiten) Illustrationen |
---|---|
Series: | |
Type of publication: | Book / Working Paper |
Language: | English |
ISBN: | 978-3-030-91025-9 ; 978-3-030-91024-2 ; 978-3-030-91026-6 ; 978-3-030-91027-3 |
Other identifiers: | 10.1007/978-3-030-91025-9 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
-
On multiprocessor temperature-aware scheduling problems
Bampis, Evripidis, (2013)
-
Jiang, Xiaojuan, (2023)
-
Bicriteria two-machine flowshop scheduling : approximation algorithms and their limits
Jiang, Xiaojuan, (2024)
- More ...
-
Efficient algorithms for flexible job shop scheduling with parallel machines
Kubiak, Wieslaw, (2020)
-
Mathematical programming modeling of the Response Time Variability Problem
Corominas, Albert, (2010)
-
A coordinating contract for transshipment in a two-company supply chain
Hezarkhani, Behzad, (2010)
- More ...