scientific article
From MaRDI portal
Publication:2753942
zbMath0974.68503MaRDI QIDQ2753942
Gerhard J. Woeginger, Hoogeveen, J. A.
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityschedulingapproximation algorithmpreemptionworst case ratioin-approximability
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (10)
Bin packing with rejection revisited ⋮ On-line scheduling with rejection on identical parallel machines ⋮ Graph multi-coloring for a job scheduling application ⋮ Scheduling with rejection and non-identical job arrivals ⋮ Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions ⋮ Scheduling linear deteriorating jobs with rejection on a single machine ⋮ Bin packing problems with rejection penalties and their dual problems ⋮ On-line scheduling of unit time jobs with rejection on uniform machines ⋮ On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
This page was built for publication:
