Online scheduling with deterioration and unexpected processor breakdown

DOI10.1016/J.TCS.2023.114058MaRDI QIDQ6047192zbMATH OpenFDO

Authors

Publication date 7 September 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2023.114058

zbMATH Keywords

deteriorationonline algorithmschedulingsingle processorunexpected breakdown

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Cites work

• A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
• An adaptive robust optimization model for parallel machine scheduling
• Approximation algorithms for single machine scheduling with one unavailability period
• Flow shop scheduling with partial resource flexibility
• LP-based online scheduling: From single to parallel machines
• Online scheduling of jobs with favorite machines
• Online scheduling of ordered flow shops
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling jobs under simple linear deterioration
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Scheduling linear deteriorating jobs with rejection on a single machine
• Scheduling with limited machine availability
• Semi-online scheduling on a single machine with unexpected breakdown
• The complexity of scheduling starting time dependent tasks with release times
• Two models of single machine scheduling with general processing time functions
• Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity

Cited in

(2)

• The prize-collecting single machine scheduling with bounds and penalties
• Single machine scheduling with a restricted weight-modifying activity to minimize the weighted makespan

This page was built for publication: Online scheduling with deterioration and unexpected processor breakdown

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047192)