Online scheduling with deterioration and unexpected processor breakdown
From MaRDI portal
Publication:6047192
DOI10.1016/j.tcs.2023.114058MaRDI QIDQ6047192
No author found.
Publication date: 7 September 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- The complexity of scheduling starting time dependent tasks with release times
- Semi-online scheduling on a single machine with unexpected breakdown
- Scheduling linear deteriorating jobs with rejection on a single machine
- LP-based online scheduling: From single to parallel machines
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
- Approximation algorithms for single machine scheduling with one unavailability period
- Scheduling jobs under simple linear deterioration
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
- Scheduling with limited machine availability
- Online scheduling of ordered flow shops
- An adaptive robust optimization model for parallel machine scheduling
- Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
- Online scheduling of jobs with favorite machines
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Flow Shop Scheduling with Partial Resource Flexibility
- Scheduling Deteriorating Jobs on a Single Processor
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Online scheduling with deterioration and unexpected processor breakdown
