Online scheduling with deterioration and unexpected processor breakdown
From MaRDI portal
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)
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)