Funder
Israel Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference14 articles.
1. Cai, J.-Y., Cai, P., & Zhu, Y. (1998). On a scheduling problem of time deteriorating jobs. Journal of Complexity, 14, 190–209.
2. Díaz-Núñez, F., Halman, N., & Vásquez, Ó. (2019). The TV advertisements scheduling problem. Optimization Letters, 13, 81–94.
3. Fontan, F., Lemaire, P., & Brauner, N. (2018). Complexity of scheduling tasks with processing time dependent profit. HAL Archives-ouvertes. Available from https://hal.archives-ouvertes.fr/hal-01947847. Accessed 23 Dec 2018.
4. Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin: Springer.
5. Halman, N., Kellerer, H., & Strusevich, V. (2018a). Approximation schemes for a non-separable non-linear boolean programming problems under nested knapsack constraints. European Journal of Operational Research, 2, 435–447.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献