The resource dependent assignment problem with a convex agent cost function.
European Journal of Operational Research(2017)
摘要
•We study the Resource Dependent Assignment Problem with a convex agent cost function.•The problem has important applications in deterministic scheduling.•We prove that three variations are NP-hard, while a single variation is not.•We design a novel approximation algorithm for an NP-hard variation of the problem.•The approximation ratio is very tight for any practical problem.
更多查看译文
关键词
Scheduling,Assignment problem,Bicriteria optimization,Controllable processing times,Approximation algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络