Scheduling problems with rejection to minimize the maximum flow time
From MaRDI portal
Publication:1691942
DOI10.1007/s11424-016-4187-4zbMath1387.90098OpenAlexW2298323795MaRDI QIDQ1691942
Publication date: 25 January 2018
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-016-4187-4
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Unnamed Item
- A survey on offline scheduling with rejection
- Single machine scheduling with release dates and rejection
- Preemptive scheduling with rejection
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Scheduling with machine cost and rejection
- Scheduling with rejection and non-identical job arrivals
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
- Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties
- Techniques for scheduling with rejection
- Multiprocessor Scheduling with Rejection
- Preemptive multiprocessor scheduling with rejection
This page was built for publication: Scheduling problems with rejection to minimize the maximum flow time