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

Scheduling with time-of-use costs Autor Chen, Bo, Zhang, Xiandong

“…•Efficient algorithms for tractable problems.•A fully polynomial-time approximation scheme for an intractable problem…”
Získať plný text

Rescheduling on identical parallel machines with machine disruptions to minimize total completion time Autor Yin, Yunqiang, Cheng, T.C.E., Wang, Du-Juan

“… to identical parallel machines that are subject to disruptions with the objective of minimizing the total completion time…”
Získať plný text

Integrated pricing and production scheduling of multiple customized products with a common base product Autor Yue, Qing, Chen, Zhi-Long, Wan, Guohua

“…Make-To-Order (MTO) is a popular production strategy commonly used by manufacturers selling customized products. Dynamic pricing is a popular tactical tool…”
Získať plný text

Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations Autor Ling, Chen, Nie, Jiawang, Qi, Liqun, Ye, Yinyu

“…; for biquadratic forms that are square-free, we give a relative approximation bound ... when min ... is a constant, we present two polynomial time approximation schemes…”
Získať plný text

A PTAS for non-resumable open shop scheduling with an availability constraint Autor Yuan, Yuan, Lan, Yan, Ding, Ning, Han, Xin

“… In this paper, we study two-machine open shop scheduling problem, provided that one machine is subject to maintenance period which has to be performed in a fixed time interval…”
Získať plný text

Scheduling Jobs with Release and Delivery Times Subject to Nested Eligibility Constraints Autor Zhang, Yu-Zhong, Li, Shu-Guang

“… For the general case of unequal release time, a polynomial time approximation scheme is derived…”
Získať plný text

Approximation schemes for two-agent scheduling on parallel machines Autor Zhao, Kejun, Lu, Xiwen

“… Furthermore, we design the fully polynomial time approximation schemes for both problems, respectively…”
Získať plný text

Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters Autor Khachay, Michael, Neznakhina, Katherine

“… The extension of these results in the field of constructing the polynomial time approximation schemes (PTAS…”
Získať plný text

Efficient computation of evacuation routes on a three-dimensional geometric network Autor Tang, Huajun, Elalouf, Amir, Levner, Eugene, Cheng, T.C.E.

“…•We formulate the stochastic routing problem as a non-linear routing problem subject to node-wise constraints…”
Získať plný text

The task allocation problem with constant communication Autor Fernandez de la Vega, W., Lamari, M.

“…,…, P m , subject to both execution and communication costs. The cost of any assignment of the tasks to the processors is defined as the sum of the corresponding…”
Získať plný text

Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation Autor Kovalyov, Mikhail Y., Pesch, Erwin, Quilliot, Alain

“…, such that the social welfare is maximized, subject to a limited budget. Chan et al. [ACM Trans. Econ. Comput. 5(2), (2017), Article 12, pp. 12:1–12:36] focus on a natural…”
Získať plný text

Two-machine flow shop scheduling with a common due date to maximize total early work Autor Chen, Xin, Miao, Qian, Lin, Bertrand M.T., Sterna, Malgorzata, Blazewicz, Jacek

“…•A fully polynomial time approximation scheme (FPTAS) is developed.•The approximation results work for the weighted model - if a specific constraint is satisfied…”
Získať plný text

Two-Agent Single Machine Scheduling with Deteriorating Jobs and Rejection Autor Li, Dawei, Li, Ganggang, Cheng, Fangzheng

“… The objective is to minimize the sum of the completion time of the accepted A-jobs and total rejection penalty of the rejected A-jobs subject to an upper bound on the sum of the given objective…”
Získať plný text

Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions Autor Halman, Nir, Wimer, Shmuel

“…•We show that when costs are arbitrary monotone nondecreasing functions, the problem becomes intractable, and design for it a fully polynomial time approximation scheme…”
Získať plný text

Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan Autor Li, Shisheng, Ng, C.T., Cheng, T.C.E., Yuan, Jinjiang

“…We consider the problem of scheduling n deteriorating jobs with release dates on a single batching machine. Each job’s processing time is an increasing simple…”
Získať plný text

Parallel-batch scheduling with rejection: Structural properties and approximation algorithms Autor Ou, Jinwen, Lu, Lingfa, Zhong, Xueling

“… However, the number of jobs in a batch is limited. Each job can be rejected subject to a job-dependent penalty cost, but the total penalty cost of the jobs rejected is required to be no…”
Získať plný text

Capacitated assortment and price optimization under the nested logit model Autor Chen, Rui, Jiang, Hai

“… For this NP-complete problem, we show that there exists a pseudo polynomial time approximation scheme that finds its ϵ…”
Získať plný text

Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing Autor Li, Weidong, Ou, Jinwen

Získať plný text

Algorithms for Communication Scheduling in Data Gathering Network with Data Compression Autor Luo, Wenchang, Xu, Yao, Gu, Boyuan, Tong, Weitian, Goebel, Randy, Lin, Guohui

“… subject to a bounded data transmission completion time (a.k.a. makespan). A recent result confirms the NP-hardness for this problem, even in the special case…”
Získať plný text

Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint Autor Moncel, Julien, Thiery, Jérémie, Waserhole, Ariel

“…•We address a scheduling problem subject to an unavailability constraint.•We study an existing interchange heuristic to minimize the total-flow time…”
Získať plný text