scientific article; zbMATH DE number 871904
From MaRDI portal
Publication:4875173
zbMATH Open0845.90068MaRDI QIDQ4875173FDOQ4875173
Authors: Jiří Sgall, Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, L. Stougie 
Publication date: 15 September 1996
Title of this publication is not available (Why is that?)
Recommendations
- Multiprocessor Scheduling with Rejection
- Preemptive multiprocessor scheduling with rejection
- Preemptive scheduling with rejection
- Parallel machine scheduling with hierarchical and rejection
- Multipurpose machine scheduling with rejection and identical job processing times
- Parallel-machine scheduling with release dates and rejection
- Scheduling with partial rejection
- scientific article; zbMATH DE number 1670665
- Parallel machine scheduling with restricted job rejection
- On multiprocessor system scheduling
identical parallel machinesmultiprocessor schedulingfully polynomial approximation schemematching lower bound
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (22)
- A manifesto for the computational method
- Parallel-machine scheduling with deteriorating jobs and rejection
- Multiprocessor Scheduling with Rejection
- Scheduling deteriorating jobs with rejection on dominant machines
- Single-machine batch scheduling problem with job rejection and resource dependent processing times
- On-line scheduling with rejection on identical parallel machines
- Preemptive multiprocessor scheduling with rejection
- Parameter learning online algorithm for multiprocessor scheduling with rejection
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- Graph multi-coloring for a job scheduling application
- Scheduling multiple variant programs under hard real-time constraints
- Scheduling linear deteriorating jobs with rejection on a single machine
- Two-machine flow-shop scheduling with rejection
- Minimizing average flow-time under knapsack constraint
- Vector scheduling with rejection on two machines
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Scheduling with rejection and non-identical job arrivals
- Proportionate flow shop scheduling with rejection
- Rejecting jobs to minimize load and maximum flow-time
- Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions
- Techniques for scheduling with rejection
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875173)
