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 | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Graphentheorie | Graph theory | Produktionswirtschaft | Production management |
-
Scheduling with agreements : new results
Bendraouche, Mohamed, (2016)
-
Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures
Chrétienne, Philippe, (2020)
-
An algorithm based on graphs for solving a fair division problem
Olvera-López, William, (2014)
- More ...
-
Efficient algorithms for flexible job shop scheduling with parallel machines
Kubiak, Wieslaw, (2020)
-
Scheduling identical jobs with chain precedence constraints on two uniform machines
Brucker, Peter, (1999)
-
Scheduling identical jobs with chain precedence constraints on two uniform machines
Brucker, Peter, (1999)
- More ...