scientific article; zbMATH DE number 871904

MaRDI QIDQ4875173zbMATH OpenFDO

Authors Jiří Sgall, Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, L. Stougie

Publication date 15 September 1996

zbMATH Keywords

identical parallel machinesmultiprocessor schedulingfully polynomial approximation schemematching lower bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

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

Cited in

(22)

• Scheduling multiple variant programs under hard real-time constraints
• Graph multi-coloring for a job scheduling application
• Techniques for scheduling with rejection
• Preemptive multiprocessor scheduling with rejection
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions
• Multiprocessor Scheduling with Rejection
• Proportionate flow shop scheduling with rejection
• Parameter learning online algorithm for multiprocessor scheduling with rejection
• Scheduling with rejection and non-identical job arrivals
• Single-machine batch scheduling problem with job rejection and resource dependent processing times
• Minimizing average flow-time under knapsack constraint
• Scheduling deteriorating jobs with rejection on dominant machines
• On-line scheduling with rejection on identical parallel machines
• Parallel-machine scheduling with deteriorating jobs and rejection
• Vector scheduling with rejection on two machines
• Scheduling linear deteriorating jobs with rejection on a single machine
• A manifesto for the computational method
• Rejecting jobs to minimize load and maximum flow-time
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
• Two-machine flow-shop 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)