Search Results - "Pseudo-polynomial algorithm"

Single-machine scheduling with an external resource by 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…”
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

Robust minimum cost flow problem under consistent flow constraints by Büsing, Christina, Koster, Arie M. C. A, Schmitz, Sabrina

“…} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\equiv $$\end{document} problem, we consider demand and supply that are subject to uncertainty…”
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

Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences by Cheng, T. C. E., Kravchenko, Svetlana A., Lin, Bertrand M. T.

“… jobs. While the two-machine problem is polynomially solvable, we show that the problem becomes binary NP-hard when the number of machines is three, and propose a pseudo-polynomial algorithm to solve…”
Get full text

Optimal coordination of resource allocation, due date assignment and scheduling decisions by Shabtay, Dvir, Steiner, George, Zhang, Rui

“…We study a single-machine scheduling problem in a flexible framework, where both job processing times and due dates are decision variables controllable by the…”
Get full text

Feedback Robustness in Structured Closed-loop System by Gundeti, RaviTeja, Moothedath, Shana, Chaporkar, Prasanna

“…This paper addresses the robustness of large-scale closed-loop structured systems in the sense of arbitrary pole placement when subject to failure of feedback links…”
Get full text

Robust scheduling of wireless sensor networks for target tracking under uncertainty by Lersteau, Charly, Rossi, André, Sevaux, Marc

“…•A maximum stability radius schedule is computed with a pseudo-polynomial algorithm.•Two classes of upper bounds are exploited to speed up convergence…”
Get full text

Optimal sourcing from alternative capacitated suppliers with general cost structures by Tan, Tarkan, Alp, Osman

“… to sell/utilize, subject to stochastic demand/requirement. Our approach advocates not to determine the quantity to be sourced a priori…”
Get full text

Pooling Problems with Polynomial-Time Algorithms by Haugland, Dag, Hendrix, Eligius M. T.

“… At the network terminals, the flow composition is subject to restrictions referred to as quality constraints…”
Get full text

Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness by Tian, Zhongjun, Ng, C.T., Cheng, T.C.E.

“… a pseudo-polynomial algorithm for it…”
Get full text

Robust Minimum Cost Flow Problem Under Consistent Flow Constraints by Büsing, Christina, Arie M C A Koster, Schmitz, Sabrina

“… (MCF) problem. In the RobMCF\(\equiv\) problem, we consider demand and supply that are subject to uncertainty…”
Get full text

Resource Competition on Integral Polymatroids by Harks, Tobias, Klimm, Max, Peis, Britta

“… As our main result, we show that in such general resource allocation problems a pure Nash equilibrium is guaranteed to exist by giving a pseudo-polynomial algorithm…”
Get full text

Packing chained items in aligned bins with applications to container transshipment and project scheduling by Briskorn, Dirk, Fliedner, Malte

“…-)polynomial algorithms for specific subproblems. We further propose and evaluate simple and fast heuristics for optimization versions of the problem…”
Get full text

A Subquadratic Approximation Scheme for Partition by Mucha, Marcin, Węgrzycki, Karol, Włodarczyk, Michał

“…The subject of this paper is the time complexity of approximating Knapsack, Subset Sum, Partition, and some other related problems…”
Get full text

Randomized Algorithms over Finite Fields for the Exact Parity Base Problem by Galbiati, Giulia, Maffioli, Francesco, Viola, Carlo

“…We present three randomized pseudo-polynomial algorithms for the problem of finding a base of specified value in a weighted represented matroid subject to parity conditions…”
Get full text