scientific article; zbMATH DE number 871904

zbMath0845.90068MaRDI QIDQ4875173

Jiří Sgall, Alberto Marchetti-Spaccamela, Stefano Leonardi, Leen Stougie, Yair Bartal

Publication date: 15 September 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

multiprocessor schedulingidentical parallel machinesfully polynomial approximation schemematching lower bound

Mathematics Subject Classification ID

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

Related Items (13)

Single-machine batch scheduling problem with job rejection and resource dependent processing times ⋮ A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling ⋮ Graph multi-coloring for a job scheduling application ⋮ Minimizing average flow-time under knapsack constraint ⋮ Proportionate Flow Shop Scheduling with Rejection ⋮ Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions ⋮ A bicriteria approach to scheduling a single machine with job rejection and positional penalties ⋮ Scheduling linear deteriorating jobs with rejection on a single machine ⋮ Two-machine flow-shop scheduling with rejection ⋮ Parallel-machine scheduling with deteriorating jobs and rejection ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Scheduling deteriorating jobs with rejection on dominant machines ⋮ Scheduling multiple variant programs under hard real-time constraints

This page was built for publication: