Výsledky vyhledávání - "polynomial-time dynamic programming algorithms"

A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses Autor Barbato, Michele, Ceselli, Alberto, Righini, Giovanni

“… In this paper, we analyze some non-trivial properties of the problem and we describe a polynomial-time dynamic programming algorithm to solve it to proven optimality…”
Získat plný text

A Polynomial-Time Dynamic Programming Algorithm for Phrase-Based Decoding with a Fixed Distortion Limit Autor Chang, Yin-Wen, Collins, Michael

“…Decoding of phrase-based translation models in the general case is known to be NP-complete, by a reduction from the traveling salesman problem (Knight, 1999)…”
Získat plný text

Energy-aware lot sizing problem: Complexity analysis and exact algorithms Autor Rapine, Christophe, Goisque, Guillaume, Akbalik, Ayse

“…The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the…”
Získat plný text

Minimizing the number of late jobs and total late work with step-learning Autor Phosavanh, Johnson, Oron, Daniel

“… dynamic programming algorithms. We also…”
Získat plný text

Single machine scheduling and due date assignment with positionally dependent processing times Autor Gordon, Valery S., Strusevich, Vitaly A.

“… We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK…”
Získat plný text

Scheduling with assignable due dates, two competing agents and late work related criteria Autor Li, Shi-Sheng, Sang, Yao-Wen, Chen, Ren-Xia, Sterna, Malgorzata, Kis, Tamas

“…This paper investigates several scheduling problems on a single machine that exhibit three key features: (i) assignable due dates are considered, meaning that…”
Získat plný text

Algorithms for optimizing cross-overs in DNA shuffling Autor He, Lu, Friedman, Alan M, Bailey-Kellogg, Chris

“…Background DNA shuffling generates combinatorial libraries of chimeric genes by stochastically recombining parent genes. The resulting libraries are subjected…”
Získat plný text

Single machine scheduling to maximize the number of on-time jobs with generalized due-dates Autor Gerstl, Enrique, Mosheiov, Gur

“…In scheduling problems with generalized due dates (gdd), the due dates are specified according to their position in the sequence, and the j -th due date is…”
Získat plný text

Nonconvex piecewise linear knapsack problems Autor Kameshwaran, S., Narahari, Y.

“…This paper considers the minimization version of a class of nonconvex knapsack problems with piecewise linear cost structure. The items to be included in the…”
Získat plný text

A note on the single machine CON and CONW problems with lot scheduling Autor Mor, Baruch, Mosheiov, Gur

“…We study extensions of the classical single machine common due-date (CON) and common due-window (CONW) assignment problems to the setting of lot scheduling. In…”
Získat plný text

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs Autor Shen, Siqian, Smith, J. Cole

“…‐time dynamic programming algorithms for solving these problems on tree structures and on series…”
Získat plný text

Parallel dedicated machine scheduling with conflict graphs Autor Hong, Huai-Che, Lin, Bertrand M.T.

“…•Scheduling with conflicts subject to fixed job sequences is introduced.•Complexity status is investigated.•Dynamic programming algorithms are developed. This…”
Získat plný text

Integrated pricing and production scheduling of multiple customized products with a common base product Autor 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…”
Získat plný text

Maximization of solution flexibility for robust shop scheduling Autor Artigues, Christian, Billaut, Jean-Charles, Esswein, Carl

“… We propose polynomial time dynamic programming algorithms for minimizing the number of groups and for maximizing the number of characterized sequences, under specific constraints. Finally, computational experiences on job shop benchmarks, show the impact of grouping operations on the solution makespan value…”
Získat plný text

Two-agent scheduling problems under rejection budget constraints Autor Oron, Daniel

“…•We consider pooled rejection budgets as well as agent dedicated budgets.•We provide efficient pseudo-polynomial time dynamic programming algorithms for the NP-hard problems under consideration…”
Získat plný text

Exact algorithms for integrated facility location and production planning problems Autor Sharkey, Thomas C., Geunes, Joseph, Edwin Romeijn, H., Shen, Zuo-Jun Max

“…We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite…”
Získat plný text

Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect Autor Xingong, Zhang, Yong, Wang

“… jobs and the total penalty for discarding jobs. For the common due date and slack due date, we give polynomial-time dynamic programming algorithms to find…”
Získat plný text

Optimally rescheduling jobs with a Last-In-First-Out buffer Autor Nicosia, Gaia, Pacifici, Andrea, Pferschy, Ulrich, Resch, Julia, Righini, Giovanni

“…This paper considers single-machine scheduling problems in which a given solution, i.e., an ordered set of jobs, has to be improved as much as possible by…”
Získat plný text

Scheduling with centralized and decentralized batching policies in concurrent open shops Autor Lin, B. M. T., Cheng, T. C. E.

“… We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo…”
Získat plný text

Lot-sizing with production and delivery time windows Autor Wolsey, Laurence A.

“… can be ordered by time, we also show equivalence to the basic lot-sizing problem with upper bounds on the stocks. Here we derive polynomial time dynamic programming…”
Získat plný text