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

doi 10.1137/1.9781611975482.96

Full Text

Abstract

Available in

Date

January 1, 2019

Authors

Janardhan Kulkarni

Publisher

Society for Industrial and Applied Mathematics

Related search

Approximation Schemes for Preemptive Weighted Flow Time

English

WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines

Mathematical Problems in Engineering

English

Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling

Management Science

Operations Research

Artificial Intelligence

English

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine

English

Rule Based Heuristic Approach for Minimizing Total Flow Time in Permutation Flow Shop Scheduling

Tehnicki Vjesnik

English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing

Computer Science

English

A Fully Polynomial Time Approximation Scheme for Packing While Traveling

Lecture Notes in Computer Science

Computer Science

Theoretical Computer Science

English

A Polynomial Time Approximation Scheme Fork-Consensus Clustering

English

Baker Game and Polynomial-Time Approximation Schemes

English