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...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 324; no. 1; pp. 40 - 48
Main Authors:	Yu, Renjie, Oron, Daniel
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2025
Subjects:	FPT Parameterized complexity Single machine W[t] XP FPT W[t] Single machine Parameterized complexity
ISSN:	0377-2217
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!