Scheduling simple linear deteriorating jobs with rejection
From MaRDI portal
Publication:1717817
DOI10.1155/2014/170475zbMath1407.90192OpenAlexW2112080171WikidataQ59063447 ScholiaQ59063447MaRDI QIDQ1717817
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/170475
Cites Work
- Unnamed Item
- Unnamed Item
- A survey on offline scheduling with rejection
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
- Parallel-machine scheduling with deteriorating jobs and rejection
- Scheduling linear deteriorating jobs with rejection on a single machine
- Single machine scheduling with release dates and rejection
- Scheduling jobs under simple linear deterioration
- A concise survey of scheduling with time-dependent processing times
- Preemptive scheduling with rejection
- Single-machine scheduling problems with an actual time-dependent deterioration
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Techniques for scheduling with rejection
- Multiprocessor Scheduling with Rejection
- Algorithms and Data Structures
This page was built for publication: Scheduling simple linear deteriorating jobs with rejection
