Search Results - "polynomial‐time approximation scheme"

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

“…•Efficient algorithms for tractable problems.•A fully polynomial-time approximation scheme for an intractable problem…”
Get full text

Rescheduling on identical parallel machines with machine disruptions to minimize total completion time by 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…”
Get full text

Integrated pricing and production scheduling of multiple customized products with a common base product by 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…”
Get full text

Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations by 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…”
Get full text

A PTAS for non-resumable open shop scheduling with an availability constraint by 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…”
Get full text

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

“… For the general case of unequal release time, a polynomial time approximation scheme is derived…”
Get full text

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

“… Furthermore, we design the fully polynomial time approximation schemes for both problems, respectively…”
Get full text

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

“… The extension of these results in the field of constructing the polynomial time approximation schemes (PTAS…”
Get full text

Efficient computation of evacuation routes on a three-dimensional geometric network by 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…”
Get full text

The task allocation problem with constant communication by 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…”
Get full text

Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation by 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…”
Get full text

Two-machine flow shop scheduling with a common due date to maximize total early work by 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…”
Get full text

Two-Agent Single Machine Scheduling with Deteriorating Jobs and Rejection by 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…”
Get full text

Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions by 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…”
Get full text

Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan by 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…”
Get full text

Parallel-batch scheduling with rejection: Structural properties and approximation algorithms by 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…”
Get full text

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

“… For this NP-complete problem, we show that there exists a pseudo polynomial time approximation scheme that finds its ϵ…”
Get full text

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

Get full text

Algorithms for Communication Scheduling in Data Gathering Network with Data Compression by 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…”
Get full text

Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint by 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…”
Get full text