Publisher
Springer Science and Business Media LLC
Reference19 articles.
1. Choi, B.C., Min, Y., Park, M.J.: Strong NP-hardness of minimizing total deviation with generalized and periodic due dates. Oper. Res. Lett. 47, 433–437 (2019)
2. Choi, B.C., Park, M.J.: Just-in-time scheduling with generalized due dates and identical due date intervals. Asia-Pac. J. Oper. Res. 35, 185004647 (2018)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
4. Garey, M.P., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 117–129 (1976)
5. Graham, R.L., Lawler, E.L., Lenstra, J.K., RinnooyKan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 3, 287–326 (1979)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献