Single-machine scheduling with machine unavailability periods and resource dependent processing times

Dvir Shabtay

European Journal of Operational Research, 2022, vol. 296, issue 2, 423-439

Abstract: We study a single-machine scheduling problem, where each of the job processing times is a bounded linear decreasing function of the amount of resource allocated to its processing operation, and there is a single and fixed machine-unavailability interval that begins at time T. A solution is given by (i) partitioning the jobs into two sets, corresponding to the set of jobs to be processed before and after the unavailability period; and (ii) defining the amount of resource allocated to the processing operation of each of the jobs. A solution is feasible if the total processing time of all jobs assigned to be processed before the unavailability period does not exceed T. Our aim is to find a feasible solution that minimizes the makespan plus the total resource consumption cost. As the problem is known to be NP-hard even for constant processing times, we focus on the design of pseudo-polynomial time and approximation algorithms. Extension to the case of a fixed number of unavailability intervals is also provided.

Keywords: Single-machine scheduling; Machine unavailability period; Controllable processing time; Resource allocation; Pseudo polynomial time algorithm; Approximation algorithms (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221721002605
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:296:y:2022:i:2:p:423-439

DOI: 10.1016/j.ejor.2021.03.034

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().