Výsledky vyhľadávania - "Polynomial-time approximation scheme"

Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date Autor 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…”
Získať plný text

A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs Autor Ding, Jian, Du, Hang, Gong, Shuyang

“…For two independent Erdős–Rényi graphs G(n,p)$$ \mathbf{G}\left(n,p\right) $$, we study the maximal overlap (i.e., the number of common edges) of these two…”
Získať plný text

Single two-stage openshop and parallel two-stage openshops scheduling with optional job rejection under makespan constraint Autor Guo, Yanjie, Luo, Wenchang, Xu, Dehua

“…We consider a scheduling scenario on single two-stage openshop and parallel two-stage openshops where there is an upper bound on the makespan of the scheduled…”
Získať plný text

Bribery in elections with randomly selected voters: Hardness and algorithm Autor Tao, Liangde, Chen, Lin, Xu, Lei, Shi, Weidong, Mahabub Uz Zaman, Md, Sunny, Ahmed

“…Many research works in computational social choice assume a fixed set of voters in an election and study the resistance of different voting rules against…”
Získať plný text

Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work Autor Yin, Yunqiang, Xu, Jianyou, Cheng, T. C. E., Wu, Chin-Chia, Wang, Du-Juan

“…We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed…”
Získať plný text

Flow shop scheduling problems with transportation constraints revisited Autor Lan, Yan, Yuan, Yuan, Wang, Yinling, Han, Xin, Zhou, Yong

Získať plný text

Penalty cost constrained identical parallel machine scheduling problem Autor Li, Weidong, Li, Jianping, Zhang, Xuejie, Chen, Zhibin

“…We consider a version of parallel machine scheduling with rejection. An instance of the problem is given by m identical parallel machines and a set of n…”
Získať plný text

Assortment optimization under the multinomial logit choice model with product-specific capacities Autor Huh, Woonghee Tim, Liu, Siyue

“…We consider assortment optimization with product-specific capacities under the multinomial logit (MNL) choice model, wherein each product has a finite…”
Získať plný text

An efficient polynomial-time approximation scheme for parallel multi-stage open shops Autor 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…”
Získať plný text

Packing squares independently Autor Wu, Wei, Numaguchi, Hiroki, Halman, Nir, Hu, Yannan, Yagiura, Mutsunori

“…Given a set of squares and a strip with bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent…”
Získať plný text

Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines Autor 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…”
Získať plný text

Single machine scheduling with release dates and rejection Autor Zhang, Liqi, Lu, Lingfa, Yuan, Jinjiang

“…In this paper, we consider the single machine scheduling problem with release dates and rejection. A job is either rejected, in which case a rejection penalty…”
Získať plný text

Truthful mechanism for joint resource allocation and task offloading in mobile edge computing Autor Liu, Xi, Liu, Jun, Li, Weidong

“…In the context of mobile edge computing (MEC), the delay-sensitive tasks can achieve real-time data processing and analysis by offloading to the MEC servers…”
Získať plný text

Parallel-machine scheduling of deteriorating jobs with potential machine disruptions Autor Yin, Yunqiang, Wang, Yan, Cheng, T.C.E., Liu, Wenqi, Li, Jinhai

“…We consider parallel-machine scheduling of deteriorating jobs in a disruptive environment in which some of the machines will become unavailable due to…”
Získať plný text

Bounded mixed batch scheduling with job release dates and rejection Autor Xu, Jun, Huang, Yong-Xing, Zhang, Daxing, Lin, Ran, Fan, Guo-Qiang

“…This paper investigates a bounded mixed batch scheduling problem with job release dates and rejection. The machine processes a batch containing several jobs…”
Získať plný text

Two-stage flexible flow shop scheduling in GPU systems Autor Jin, Ruyan, Tong, Weitian, Xu, Yao, Dong, Jianming

Získať plný text

Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date Autor Chen, Xin, Liang, Yage, Sterna, Małgorzata, Wang, Wen, Błażewicz, Jacek

“…•Fully polynomial time approximation scheme for early work maximization is proposed.•The new FPTAS dominates PTAS for the two-machine case known from the…”
Získať plný text

Approximation schemes for r-weighted Minimization Knapsack problems Autor Elbassioni, Khaled, Karapetyan, Areg, Nguyen, Trung Thanh

“…Stimulated by salient applications arising from power systems, this paper studies a class of non-linear Knapsack problems with non-separable quadratic…”
Získať plný text

A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint Autor Tong, Weitian, Xu, Yao, Zhang, Huili

“…As a hybrid of the Parallel Two-stage Flowshop problem and the Multiple Knapsack problem, we investigate the scheduling of parallel two-stage flowshops under…”
Získať plný text

Approximation algorithms for the integrated path and bin packing problem Autor Li, Weidong, Sun, Ruiqing

“…In this paper, we consider the integrated path and bin packing problem, which to use the minimum number of unit-size bins to packing the arcs on the path…”
Získať plný text