1 |
Pinedo M . Scheduling: Theory, Algorithm and Systems (5th Ed.)[M]. New York: Springer, 2016.
|
2 |
Graham R L . Bounds for certain multiprocessing anomalies[J]. Bell Labs Technical Journal, 1966, 45, 1563- 1581.
doi: 10.1002/j.1538-7305.1966.tb01709.x
|
3 |
Graham R L , Lawler E L , Lenstra J K , et al. Optimization and approximation in deterministic sequencing and scheduling: A survey[J]. Annuals of Discrete Mathematics, 1979, 5, 287- 326.
|
4 |
Lam S , Sethi R . Worst case analysis of two scheduling algorithms[J]. SIAM Journal on Computing, 1977, 6, 518- 536.
doi: 10.1137/0206037
|
5 |
Braschi B , Trystram D . A new insight into the Coffman-Graham algorithm[J]. SIAM Journal on Computing, 1994, 23, 662- 669.
doi: 10.1137/S0097539790181889
|
6 |
Gangal D , Ranade A . Precedence constrained scheduling in $(2 - \frac {7}{3p+1}) \cdot$optimal[J]. Journal of Computer and System Sciences, 2008, 74, 1139- 1146.
doi: 10.1016/j.jcss.2008.04.001
|
7 |
Bansal N, Khot S. Optimal long code test with one free bit[C]//Proceedings of FOCS 2009, 2009: 453-462.
|
8 |
Svensson O. Conditional hardness of precedence constrained scheduling on identical machines[C]//Proceedings of STOC 2010, 2010: 745-754.
|
9 |
Garey M R , Johnson D S . Computers and Intractability: A Guide to the Theory of NP-Completeness[M].
|
10 |
Schuurman P , Woeginger G J . Polynomial time approximation algorithms for machine scheduling: Ten open problems[J]. Journal of Scheduling, 1999, 2, 103- 213.
|
11 |
Levey E, Rothvoss T. A (1 + $\varepsilon$)-approximation for makespan scheduling with precedence constraints using LP hierarchies[C]//Proceedings of SODA 2016, 2016: 168-177.
|
12 |
Prot D , Bellenguez-Morinea O . A survey on how the structure of precedence constraints may change the complexity class of scheduling problems[J]. Journal of Scheduling, 2018, 21, 3- 16.
doi: 10.1007/s10951-017-0519-z
|
13 |
Leung J Y T , Vornberger O , Witthoff J D . On some variants of the bandwidth minimization problem[J]. SIAM Journal on Computing, 1984, 13, 650- 667.
doi: 10.1137/0213040
|
14 |
Timkovsky V G . Identical parallel machines vs. chains in scheduling complexity[J]. European Journal of Operational Research, 2003, 149, 355- 376.
doi: 10.1016/S0377-2217(02)00767-1
|
15 |
Brucker P , Jurisch B , Jurisch M Z . Open shop problems with unit time operations[J]. Operations Research, 1993, 37, 59- 73.
|
16 |
Bruno J , Jones Ⅲ J W , So K . Deterministic scheduling with pipelined processors[J]. IEEE Transactions on Computers, 1980, 29, 308- 316.
|
17 |
Bräsel H , Kluge D , Werner F . A polynomial algorithm for the $[n/m/0, t_ij=1, { \rm{tree}} /C_{\max}]$ open shop problem[J]. European Journal of Operational Research, 1994, 72, 125- 134.
doi: 10.1016/0377-2217(94)90335-2
|
18 |
Brucker P , Knust S . Complexity results for single-machine problems with positive finish-start time-lags[J]. Computing, 1999, 63, 299- 316.
doi: 10.1007/s006070050036
|
19 |
Chen Y , Goebel R , Lin G , et al. Open-shop scheduling for unit jobs under precedence constraints[J]. Theoretical Computer Science, 2020, 803, 144- 151.
doi: 10.1016/j.tcs.2019.09.046
|
20 |
Tanaev V S , Sotskov Y N , Strusevich V A . Scheduling Theory: Multi-Stage Systems[M]. Netherlands: Springer, 1994.
|
21 |
Hopcroft J E , Karp R M . An $n^{\frac 52}$ algorithm for maximum matchings in bipartite graphs[J]. SIAM Journal on Computing, 1973, 2, 225- 231.
doi: 10.1137/0202019
|
22 |
Karzanov A V . O nakhozhdenii maksimal'nogo potoka v setyakh spetsial'nogo vida i nekotorykh prilozheniyakh (in Russian; title translation: On finding maximum flows in networks with special structure and some applications)[J]. Matematicheskie Voprosy Upravleniya Proizvodstvom, 1973, 5, 81- 94.
|
23 |
Madry A. Navigating central path with electrical flows: From flows to matchings, and back[C]//Proceedings of FOCS 2013, 2013: 253-262.
|
24 |
Potts C N , Shmoys D B , Williamson D P . Permutation vs. non-permutation flow shop schedules[J]. Operations Research Letters, 1991, 10, 281- 284.
doi: 10.1016/0167-6377(91)90014-G
|