Scheduling with cardinality dependent unavailability periods

G. Jaykrishnan and Asaf Levin

European Journal of Operational Research, 2024, vol. 316, issue 2, 443-458

Abstract: We consider non-preemptive scheduling problems on parallel identical machines where machines change their status from being available to being unavailable and vice versa along the time horizon. The particular form of unavailability we consider is when the starting time of each downtime depends upon the cardinality of the job subset processed on that machine since the previous downtime. We consider the problem of minimizing the makespan in such scenarios as well as its dual problem where we have a fixed common deadline of 1 and the goal is to minimize the number of machines for which there is a feasible schedule. We develop an EPTAS for the first variant and an AFPTAS for the second variant.

Keywords: Scheduling; Bin packing; Approximation schemes (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722172400170X
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:316:y:2024:i:2:p:443-458

DOI: 10.1016/j.ejor.2024.02.038

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 ().