Výsledky vyhľadávania - "Pseudo polynomial time algorithm"

Scheduling problems with rejection in green manufacturing industry Autor Kong, Fanyu, Song, Jiaxin, Miao, Cuixia, Zhang, Yuzhong

“… is not more than a given threshold. We present pseudo-polynomial time algorithms and 2-approximation algorithms for the single-machine and the parallel-machine problems, respectively…”
Získať plný text

Two-agent parallel-machine scheduling with rejection Autor 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…”
Získať plný text

Proportionate flow-shop scheduling with rejection Autor Shabtay, Dvir, Oron, Daniel

“…In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for…”
Získať plný text

A note on a two-agent scheduling problem related to the total weighted late work Autor Zhang, Yuan, Yuan, Jinjiang

“…) the general version. The authors presented polynomial-time algorithms for the first two versions and a pseudo-polynomial-time algorithm for the last one…”
Získať plný text

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

“… Our scheduling objective is to minimize the total cost of processing all the jobs subject to a minimum level of performance in one of the regular scheduling criteria…”
Získať plný text

Offloading Algorithms for Maximizing Inference Accuracy on Edge Device in an Edge Intelligence System Autor Fresa, Andrea, Champati, Jaya Prakash

“…With the emergence of edge computing, the problem of offloading jobs between an Edge Device (ED) and an Edge Server (ES) received significant attention in the…”
Získať plný text

NP-hardness of deciding convexity of quartic polynomials and related problems Autor Ahmadi, Amir Ali, Olshevsky, Alex, Parrilo, Pablo A., Tsitsiklis, John N.

“…We show that unless P = NP, there exists no polynomial time (or even pseudo-polynomial time…”
Získať plný text

Degeneracy Loci and Polynomial Equation Solving Autor Bank, Bernd, Giusti, Marc, Heintz, Joos, Lecerf, Grégoire, Matera, Guillermo, Solernó, Pablo

“…). The maximal degree of these degeneracy loci constitutes the essential ingredient for the uniform, bounded-error probabilistic pseudo-polynomial-time algorithm that we will design and that solves…”
Získať plný text

Approximation schemes for single machine scheduling with non-renewable resource constraints Autor Györgyi, Péter, Kis, Tamás

“… We show that the problem admits a pseudo-polynomial time algorithm when the number of replenishments is not part of the input, and also present an FPTAS when there is only a single resource…”
Získať plný text

Two‐agent scheduling on a single sequential and compatible batching machine Autor Li, Shisheng, Cheng, T.C.E., Ng, C.T., Yuan, Jinjiang

“…We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility…”
Získať plný text

SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS Autor LI, SHISHENG, FAN, BAOQIANG

“…}$ . Furthermore, we propose a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme for the problem with a single nonavailability interval…”
Získať plný text

Primary–secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines Autor Wan, Long, Ma, Ran, Yuan, Jinjiang

“… as the total completion time of the jobs scheduled on the machine. The problem is to find a non-preemptive schedule of minimizing the secondary objective subject to the constraint that the primary objective is minimized…”
Získať plný text

The unbounded parallel-batch scheduling with rejection Autor Zhang, L Q, Lu, L F, Ng, C T

“…) to minimize the total completion time of the accepted jobs subject to an upper bound on the total rejection penalty of the rejected jobs; (3…”
Získať plný text

Two-machine flowshop scheduling in a physical examination center Autor Wang, Yadong, Fan, Baoqiang, Zhai, Jingang, Xiong, Wei

“… The objective is to minimize the makespan. We first analyze the complexity of the problem with a fixed number of release dates and present a pseudo-polynomial-time algorithm…”
Získať plný text

SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS Autor Li, Shisheng, Fan, Baoqiang

“… Furthermore, we propose a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme for the problem with a single nonavailability interval…”
Získať plný text

The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints Autor Bogue, Eduardo T., Guimaraes, Marcos V. A., Noronha, Thiago F., Pereira, Armando H., Carvalho, Iago A., Urrutia, Sebastian

“… The problem asks for the cutting of a set of items with the minimum amount of raw material. The cutting patterns are subject to a number of constraints, including a new…”
Získať plný text

Resilient Sensor Placement for Kalman Filtering in Networked Systems: Complexity and Algorithms Autor Ye, Lintao, Roy, Sandip, Sundaram, Shreyas

“…) subject to a sensor placement budget constraint in order to minimize the trace of the steady-state error covariance of the corresponding Kalman filter…”
Získať plný text

Two competing agents with due date assignment scheduling under multitasking environment Autor Yang, Yongjian, Yin, Yunqiang, Shi, Qian

“…We consider multitasking scheduling on a single machine involving two competing agents, in which the due date of each job of the first agent is a decision…”
Získať plný text

Safe Online Bid Optimization with Return-On-Investment and Budget Constraints subject to Uncertainty Autor Castiglioni, Matteo, Nuara, Alessandro, Romano, Giulia, Spadaro, Giorgio, Trovò, Francesco, Gatti, Nicola

“…=NP, and we provide a pseudo-polynomial-time algorithm that achieves an optimal solution…”
Získať plný text

Lower Bounds for Matroid Optimization Problems with a Linear Constraint Autor Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

“… (i.e., maximizes or minimizes) a linear objective function subject to (i) a matroid independent set, or a matroid basis constraint, (ii…”
Získať plný text