Search Results - "Fully polynomial-time approximation scheme"

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

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

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

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

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

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

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

Near optimal bounded route association for drone-enabled rechargeable WSNs by Wu, Tao, Yang, Panlong, Dai, Haipeng, Li, Ping, Rao, Xunpeng

“… We first formulate a bounded route association problem which is proven to be NP-hard. Then we cast it as maximizing a monotone submodular function subject to matroid constraints and devise an efficient and accessible algorithm with a 13α…”
Get full text

Single-machine scheduling of multiple projects with controllable processing times by Geng, Zhichao, Yuan, Jinjiang

“…•The single-machine multiple-project scheduling problems.•The processing times of jobs are controllable.•The processing cost of a project includes total…”
Get full text

Approximation algorithms for drone delivery scheduling with a fixed number of drones by Jana, Saswata, Mandal, Partha Sarathi

“… This paper proposes an optimal pseudo-polynomial algorithm and a fully polynomial time approximation scheme (FPTAS…”
Get full text

Due date assignment and scheduling on a single machine with two competing agents by Wang, Du-Juan, Yin, Yunqiang, Cheng, Shuenn-Ren, Cheng, T.C.E., Wu, Chin-Chia

“… (minimising the objective of one agent, subject to an upper bound on the objective of the other…”
Get full text

Optimizing Two-Truck Platooning With Deadlines by Xu, Wenjie, Cui, Titing, Chen, Minghua

“… We prove that the two-truck platooning problem is weakly NP-hard and admits a Fully Polynomial Time Approximation Scheme (FPTAS…”
Get full text

Maximizing total early work in a distributed two‐machine flow‐shop by Dolgui, Alexandre, Kovalyov, Mikhail Y., Lin, Bertrand M. T.

“…) running time dynamic programming algorithm was proposed and converted into an On4ε2$$ O\left(\frac{n^4}{\varepsilon^2}\right) $$ time fully polynomial time approximation scheme…”
Get full text

Two-agent parallel-machine scheduling with rejection by Li, Dawei, Lu, Xiwen

“… The objective is to minimize the sum of the given objective function fA of the accepted A-jobs and the total rejection penalty of the rejected A-jobs subject to an upper bound on the sum of the given…”
Get full text

Coordinated order scheduling and outsourcing on dedicated parallel machines by Ou, Jinwen, Li, Weidong, Zhong, Xueling

“… For each of the two problems when m is fixed, we present a quasi-linear-time FPTAS (fully polynomial time approximation scheme…”
Get full text

Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan by Ji, Min, Cheng, T.C.E.

“…We consider a scheduling problem in which n jobs are to be processed on a single machine. The jobs are processed in batches and the processing time of each job…”
Get full text