Scheduling Jobs on Unreliable Machines Subject to Linear Risk
Abstrak
<i>Background</i>: This paper addresses a new class of scheduling problems in the context of machines subject to (unrecoverable) interruptions; i.e., when a machine fails, the current and subsequently scheduled work on that machine is lost. Each job has a certain processing time and a reward that is attained if the job is successfully completed. <i>Methods</i>: For the failure process, we considered the linear risk model, according to which the probability of machine failure is uniform across a certain time horizon. <i>Results</i>: We analyzed both the situation in which the set of jobs is given, and that in which jobs must be selected from a pool of jobs, at a certain selection cost. <i>Conclusions</i>: We characterized the complexity of various problems, showing both hardness results and polynomial algorithms, and pointed out some open problems.
Topik & Kata Kunci
Penulis (2)
Alessandro Agnetis
Ilaria Salvadori
Akses Cepat
- Tahun Terbit
- 2025
- Sumber Database
- DOAJ
- DOI
- 10.3390/logistics9040157
- Akses
- Open Access ✓