A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
Year of publication: |
2023
|
---|---|
Authors: | Min, Yunhong ; Choi, Byung-Cheon ; Park, Myoung-Ju ; Kim, Kyung Min |
Published in: |
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies. - Berlin : Springer, ISSN 1614-2411, ZDB-ID 2106212-2. - Vol. 21.2023, 3, p. 421-437
|
Subject: | Branch and bound | Computational complexity | Early work | Scheduling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
Rudek, R., (2014)
-
Ozturk, Onur, (2017)
-
Zhang, Yurong, (2025)
- More ...
-
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
Choi, Byung-Cheon, (2019)
-
Two-machine flow shops with an optimal permutation schedule under a storage constraint
Min, Yunhong, (2020)
-
A continuous time–cost tradeoff problem with multiple milestones and completely ordered jobs
Choi, Byung-Cheon, (2015)
- More ...