An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences

In this paper we consider a resource-constrained scheduling problem on two parallel dedicated machines with given fixed processing sequences of jobs assigned to each one of the machines. The problem is to determine the starting times of all jobs, subject to the resource constraint, in order to minim...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Optimization letters Ročník 16; číslo 4; s. 1181 - 1196
Hlavní autori: Halman, Nir, Vinetz, Uriel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2022
Predmet:
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
approximation sets and functions
Dynamic programming
FPTAS
Relocation scheduling
ISSN:1862-4472, 1862-4480
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper we consider a resource-constrained scheduling problem on two parallel dedicated machines with given fixed processing sequences of jobs assigned to each one of the machines. The problem is to determine the starting times of all jobs, subject to the resource constraint, in order to minimize some given performance measure. Lin et al. (J Sched 19(2):153–163, 2016) showed that the problem is NP-hard in the ordinary sense under the performance measures of weighted total tardiness and weighted number of tardy jobs, and questioned the existence of approximation schemes. In this paper we answer their question in the affirmative by designing fully polynomial time approximation schemes.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-021-01772-7