Scheduling with periodic availability constraints to minimize makespan

Lishi Yu and Zhiyi Tan ()
Additional contact information
Lishi Yu: Zhejiang University
Zhiyi Tan: Zhejiang University

Journal of Scheduling, 2024, vol. 27, issue 3, No 5, 277-297

Abstract: Abstract We study scheduling problems with periodic availability constraints. Each machine is periodically unavailable due to routine arrangements or regular maintenance. The availability periods and unavailability periods, each with the same duration, appear alternately on each machine. All jobs are available at time zero, and no job preemption is allowed. The objective is to minimize the makespan. We conduct the worst-case analysis of two algorithms, SFFD and DFFD, with respect to parameter $$\beta $$ β , the ratio between the length of an unavailability period and an availability period. For the single machine problem, the worst-case ratio of the algorithm SFFD is given, and the bound is tight when $$\beta >0.1022$$ β > 0.1022 . An algorithm with a worst-case ratio arbitrarily close to $$\frac{2\beta +2}{\beta +2}$$ 2 β + 2 β + 2 is also presented. For the two machines problem, we propose a new algorithm DFFD and show its tight worst-case ratio.

Keywords: Scheduling; Worst-case analysis; Single machine; Parallel machines; Machine availability constraints (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-023-00790-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jsched:v:27:y:2024:i:3:d:10.1007_s10951-023-00790-w

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-023-00790-w

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().