Scheduling Position-Dependent Maintenance Operations in Single Machine Layouts

Andreas Hipp ()
Additional contact information
Andreas Hipp: Institute for Business Administration, esp. Management Science and Operations Research, Helmut Schmidt University

Chapter Chapter 4 in Operations Research Proceedings 2023, 2025, pp 25-31 from Springer

Abstract: Abstract In this paper, we consider the single machine scheduling problem of minimizing the number of late jobs taking into account ready times, due dates, and uniform processing times. Assuming limited machine availability, position-dependent maintenance operations of uniform length must be performed on the machine no later than a given number of scheduled jobs. This type of maintenance can be found in any real-world setting where the number of jobs, rather than their length, is the main cause of deterioration, such as aircraft landing gear. We discuss the characteristics of this scheduling problem and formulate an algorithm to solve the above single machine problem in polynomial time.

Keywords: Position-dependent Maintenance; Dynamic Programming (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:lnopch:978-3-031-58405-3_4

Ordering information: This item can be ordered from
http://www.springer.com/9783031584053

DOI: 10.1007/978-3-031-58405-3_4

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().