Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling- United States

doi 10.1007/s10951-009-0134-8

Full Text

Abstract

Available in

Categories

Management Science

Operations Research

Artificial Intelligence

Date

September 25, 2009

Authors

Steef van de Velde

Publisher

Springer Science and Business Media LLC

Related search

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Journal of Computer and System Sciences

Computer Networks

Applied Mathematics

Computational Theory

Theoretical Computer Science

English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing

Computer Science

English

Baker Game and Polynomial-Time Approximation Schemes

English

Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems.

English

Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

Applied Mathematics

Computer Science Applications

Computer Science

English

Approximation Schemes for Preemptive Weighted Flow Time

English

A Polynomial Time Constant Approximation for Minimizing Total Weighted Flow-Time

English

Polynomial Time Algorithms for Scheduling of Arrival Aircraft

English

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in H-Free Graphs

English