Search Results - "efficient polynomial-time approximation scheme"

An efficient polynomial-time approximation scheme for parallel multi-stage open shops by Dong, Jianming, Jin, Ruyan, Lin, Guohui, Su, Bing, Tong, Weitian, Xu, Yao

“…Various new scheduling problems have been arising from real-world applications and spawning new research areas in the scheduling field. We study the parallel…”
Get full text

Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date by Li, Wei-Dong

“…We study the early work scheduling problem on identical parallel machines in order to maximize the total early work, i.e., the parts of non-preemptive jobs…”
Get full text

Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines by Sun, Ruiqing

“…In this paper, we discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The objective is to…”
Get full text

Polynomial-Time Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows by Khachai, M. Yu, Ogorodnikov, Yu. Yu

“…The capacitated vehicle routing problem with time windows (CVRPTW) is a well-known NP-hard combinatorial optimization problem. We present a further development…”
Get full text

There is no EPTAS for two-dimensional knapsack by Kulik, Ariel, Shachnai, Hadas

“…In the d-dimensional ( vector) knapsack problem given is a set of items, each having a d-dimensional size vector and a profit, and a d-dimensional bin. The…”
Get full text