Bentert, M and Bredereck, R and Györgyi, Péter and Kaczmarczyk, A and Niedermeier, R (2023) A multivariate complexity analysis of the material consumption scheduling problem. JOURNAL OF SCHEDULING, 26. pp. 369-382. ISSN 1094-6136 10.1007/s10951-022-00771-5

Preview

Text Bentert_369_33594613_ny.pdf Download (412kB) | Preview

Abstract

The NP-hard problem Material Consumption Scheduling and related problems have been thoroughly studied since the 1980’s. Roughly speaking, the problem deals with scheduling jobs that consume non-renewable resources—each job has individual resource demands. The goal is to minimize the makespan. 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 precondition for processing further jobs. We initiate a systematic exploration of the parameterized computational complexity landscape of Material Consumption Scheduling , providing parameterized tractability as well as intractability results. Doing so, we mainly investigate how parameters related to the resource supplies influence the problem’s computational complexity. This leads to a deepened understanding of this fundamental scheduling problem.

Item Type:	Article
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Research Laboratory on Engineering & Management Intelligence
SWORD Depositor:	MTMT Injector
Depositing User:	MTMT Injector
Date Deposited:	29 Jul 2023 15:39
Last Modified:	11 Sep 2023 14:56
URI:	https://eprints.sztaki.hu/id/eprint/10557

Update Item