Publisher
Springer International Publishing
Reference23 articles.
1. Graham, R.L., Lawner, E.L., Rinnoy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling. A surv. Ann. Disc. Math. 5(10), 287–326 (1979)
2. Brucker, P.: Scheduling Algorithms, 5th edn. Springer, Berlin (2007)
3. J. Omer, A. Mucherino, Referenced vertex ordering problem. Theory, Applications and Solution Methods HAL Open Archives, hal-02509522, version 1 (Mar 2020)
4. Ullman, J.: NP-complete scheduling problems. J. Comput. Syst. Sci. 171, 394–394 (1975)
5. Artigues, C., Feillet, D.: A branch and bound method for the job-shop problem with sequence-dependent setup times. Ann. Oper. Res. 159, 135–159 (2008)