Single-machine scheduling with fixed energy recharging times to minimize the number of late jobs and the number of just-in-time jobs: A parameterized complexity analysis

We study single-machine scheduling problems where processing each job requires both processing time and rechargeable energy. Subject to a predefined energy capacity, energy can be recharged after each job during a fixed recharging period. Our focus is on two due date-related scheduling criteria: min...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 324; číslo 1; s. 40 - 48
Hlavní autori:	Yu, Renjie, Oron, Daniel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.07.2025
Predmet:	FPT Parameterized complexity Single machine W[t] XP FPT W[t] Single machine Parameterized complexity
ISSN:	0377-2217
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!