Material消费调度问题的多变量复杂性分析
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem
摘要：
NP难物料消耗调度问题及其相关问题自20世纪80年代以来得到了深入的研究。粗略地说，该问题涉及最小化的最大完工时间时，消耗不可再生资源的调度作业。我们专注于单机情况下没有抢占：不时地，机器的资源（部分）补充，从而允许满足必要的先决条件处理进一步的工作，其中每一个有单独的资源需求。我们开始了系统的探索的参数化（确切）的复杂性景观的问题，提供参数化的易处理性以及棘手的结果。这样做，我们主要研究如何与资源供应的参数影响计算可解性。从而，我们得到了一个更深入的了解这个基本的调度问题的算法复杂性。
英文摘要：
The NP-hard MATERIAL CONSUMPTION SCHEDULING Problem and closely related problems have been thoroughly studied since the 1980's. Roughly speaking, the problem deals with minimizing the makespan when scheduling jobs that consume non-renewable resources. We focus on the single-machine case without preemption: from time to time, the resources of the machine are (partially) replenished, thus allowing for meeting a necessary pre-condition for processing further jobs, each of which having individual resource demands. We initiate a systematic exploration of the parameterized (exact) complexity landscape of the problem, providing parameterized tractability as well as intractability results. Doing so, we mainly investigate how parameters related to the resource supplies influence the computational solvability. Thereby, we get a deepened understanding of the algorithmic complexity of this fundamental scheduling problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
