Výsledky vyhledávání - "pseudo-polynomial algorithm"

Single-machine scheduling of multiple projects with controllable processing times Autor 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…”
Získat plný text

Single-machine scheduling with an external resource Autor Briskorn, Dirk, Davari, Morteza, Matuschke, Jannik

“…highlights•We study single-machine scheduling with an external resource.•We look at four different classes of problems with an external resource.•For each…”
Získat plný text

A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs Autor Bunn, Kevin A., Ventura, José A.

“…•A pseudo-polynomial algorithm to solve the two-product capacitated dynamic lot-sizing problem is proposed.•The structure of an optimal solution is analyzed…”
Získat plný text

A convex programming-based algorithm for mean payoff stochastic games with perfect information Autor Boros, Endre, Elbassioni, Khaled, Gurvich, Vladimir, Makino, Kazuhisa

“…We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = ( V , E ) , with local rewards r :…”
Získat plný text

An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem Autor Elalouf, Amir, Levner, Eugene, Tang, Huajun

“…Recently, Shabtay and Bensoussan ( 2012 ) developed an original exact pseudo-polynomial algorithm and an efficient -approximation algorithm (FPTAS) for…”
Získat plný text

Stochastic binary problems with simple penalties for capacity constraints violations Autor Fortz, B., Labbé, M., Louveaux, F., Poss, M.

“…This paper studies stochastic programs with first-stage binary variables and capacity constraints, using simple penalties for capacities violations. In…”
Získat plný text

Approximation schemes for a class of subset selection problems Autor Pruhs, Kirk, Woeginger, Gerhard J.

“…In this paper we develop an easily applicable algorithmic technique/tool for developing approximation schemes for certain types of combinatorial optimization…”
Získat plný text

Static and dynamic source locations in undirected networks Autor Turner, Lara, Groß, Dwi Poetranto, Hamacher, Horst W., Krumke, Sven O.

“…Results from source location in the form of single cover problems in static networks are reviewed and extended by new results for the most general problem with…”
Získat plný text

A note on a single machine scheduling problem with generalized total tardiness objective function Autor Gafarov, Evgeny R., Lazarev, Alexander A., Werner, Frank

“…In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. A pseudo-polynomial time solution algorithm…”
Získat plný text

Approximations for Restrictions of The Budgeted and Generalized Maximum Coverage Problems Autor Piva, Breno

“…In this paper we present approximation preserving reductions from the Budgeted and Generalized Maximum Coverage Problems to the Knapsack Problem with Conflict…”
Získat plný text

Simultaneous minimization of total completion time and total deviation of job completion times Autor Mosheiov, Gur

“…This paper addresses a single-machine scheduling problem with the objective of minimizing a linear combination of total job completion times and total…”
Získat plný text

Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem Autor Kravchenko, Svetlana A.

“…This paper considers the problem of minimizing the weighted number of late jobs in the two-machine job-shop with unit time operations. We show its NP-hardness…”
Získat plný text

A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem Autor Kuno, Takahito, Utsunomiya, Takahiro

“…In this paper, we propose a primal-dual algorithm for solving a class ofproduction-transportation problems. Among m(≥ 2) sources two factoriesexist, which…”
Získat plný text

Interfering Job Set Scheduling on Two-Operation Three-Machine Flowshop Autor Nguyen, Huynh Tuong, Soukhal, Ameur

“…This paper considers three machine flowshop scheduling problem with two agents. The jobs of first agent have two operations executed in the same order, on M 1…”
Získat plný text

An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem Autor Arkhipov, Dmitry, Battaïa, Olga, Lazarev, Alexander

“…•New task domain adjustment techniques for project scheduling problem are presented.•A pseudo-polynomial algorithm is developed for a lower bound on project…”
Získat plný text

Network flow interdiction on planar graphs Autor Zenklusen, R.

“…The network flow interdiction problem asks to reduce the value of a maximum flow in a given network as much as possible by removing arcs and vertices of the…”
Získat plný text

On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness Autor Boros, Endre, Elbassioni, Khaled, Gurvich, Vladimir, Makino, Kazuhisa

“…It is shown that the discount factor needed to solve an undiscounted mean payoff stochastic game to optimality is exponentially close to 1, even in one-player…”
Získat plný text

On the complexity of the car sequencing problem Autor Kis, Tamás

“…In this note we give an easier proof of the known result that the car sequencing problem is NP-hard, and point out that it is NP-hard in the strong sense. We…”
Získat plný text