Search Results - "polynomial-time dynamic programming algorithms"

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms

Authors: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe et al.

Contributors: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe et al.

Subject Terms: FOS: Computer and information sciences, Quantum Physics, Dynamic Programming, Data Structures and Algorithms, Quantum Algorithms, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), ddc:004, Quantum Physics (quant-ph), Quantum Random Access Memory

File Description: application/pdf

Access URL: http://arxiv.org/abs/2507.00823
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.14

Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time: Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time

Authors: James B. Saxe

Source: SIAM Journal on Algebraic Discrete Methods. 1:363-369

Subject Terms: Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, 0102 computer and information sciences, bandwidth of a graph, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/3782384
https://doi.org/10.1137/0601042

Concurrent operations assignment and sequencing for particular assembly problems in flow lines

Authors: AGNETIS A. ARBIB, CLAUDIO Agnetis, Alessandro et al.

Contributors: AGNETIS A. ARBIB, CLAUDIO Agnetis, Alessandro et al.

Source: Annals of Operations Research. 69:1-31

Subject Terms: polynomial-time dynamic programming algorithms, Deterministic scheduling theory in operations research, flow shop scheduling, dynamic programming, makespan, sequencing, assigning, Abstract computational complexity for mathematical programming problems, flow line, precedence constraints

File Description: application/xml; STAMPA

Access URL: https://econpapers.repec.org/article/sprannopr/v_3a69_3ay_3a1997_3ai_3a0_3ap_3a1-31_3a10.1023_2fa_3a1018916608787.htm
https://usiena-air.unisi.it/handle/11365/29446
https://link.springer.com/article/10.1023/A:1018916608787
https://dblp.uni-trier.de/db/journals/anor/anor69.html#AgnetisA97
https://ideas.repec.org/a/spr/annopr/v69y1997i0p1-3110.1023-a1018916608787.html
https://hdl.handle.net/11697/23406
https://doi.org/10.1023/A:1018916608787
http://link.springer.com/article/10.1023/A:1018916608787

Minimizing the number of late jobs and total late work with step-learning.

Authors: Phosavanh, Johnson Oron, Daniel

Source: European Journal of Operational Research. Mar2025, Vol. 321 Issue 3, p734-749. 16p.

Subject Terms: *DYNAMIC programming, *PRODUCTION scheduling, *UNEMPLOYMENT, *PROBLEM solving, *ALGORITHMS

Scheduling with assignable due dates, two competing agents and late work related criteria.

Authors: Li, Shi-Sheng Sang, Yao-Wen Chen, Ren-Xia et al.

Source: Computers & Operations Research. Oct2025, Vol. 182, pN.PAG-N.PAG. 1p.

Subject Terms: *WORKING hours, *DYNAMIC programming, *ALGORITHMS, POLYNOMIAL time algorithms, TARDINESS

Optimally rescheduling jobs with a Last-In-First-Out buffer.

Authors: Nicosia, Gaia Pacifici, Andrea Pferschy, Ulrich et al.

Source: Journal of Scheduling; Dec2021, Vol. 24 Issue 6, p663-680, 18p

Subject Terms: DYNAMIC programming, UNEMPLOYMENT statistics, ALGORITHMS, OCCUPATIONAL mobility, TARDINESS

A note on the single machine CON and CONW problems with lot scheduling.

Authors: Mor, Baruch Mosheiov, Gur

Source: Journal of Combinatorial Optimization; Aug2021, Vol. 42 Issue 2, p327-338, 12p

Single machine scheduling to maximize the number of on-time jobs with generalized due-dates.

Authors: Gerstl, Enrique Mosheiov, Gur

Source: Journal of Scheduling; Jun2020, Vol. 23 Issue 3, p289-299, 11p

Subject Terms: NP-hard problems, INTEGER programming, DYNAMIC programming

Multitasking scheduling with job switching allowed between alternate periods.

Authors: Wang, Yan Wang, Jun-Qiang Huo, Yumei

Source: International Journal of Production Research; Aug2024, Vol. 62 Issue 16, p5966-5988, 23p

Subject Terms: DYNAMIC programming, SCHEDULING, SWITCHING costs, TARDINESS, SHIFT systems, SUPPLEMENTARY employment

Minimum Free Energy, Partition Function and Kinetics Simulation Algorithms for a Multistranded Scaffolded DNA Computer

Authors: Ahmed Shalaby and Chris Thachuk and Damien Woods Shalaby, Ahmed Thachuk, Chris et al.

Index Terms: thermodynamic computation, model of computation, molecular computing, minimum free energy, partition function, DNA computing, DNA self-assembly, DNA strand displacement, kinetics simulation, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DNA.29.1
Is Part Of LIPIcs, Volume 276, 29th International Conference on DNA Computing and Molecular Programming (DNA 29) (2023)

Integrated pricing and production scheduling of multiple customized products with a common base product.

Authors: Yue, Qing Chen, Zhi-Long Wan, Guohua

Source: IISE Transactions; Dec2019, Vol. 51 Issue 12, p1383-1401, 19p, 11 Charts

Subject Terms: PRODUCTION scheduling, NP-hard problems, SUPPLY & demand, TIME-based pricing, DYNAMIC programming, MANUFACTURED products, STOCHASTIC programming

Scheduling on proportionate flowshop with total late work and job rejection.

Authors: Geng, Xin-Na Sun, Xinyu Wang, Jiayin et al.

Source: Operational Research; Sep2025, Vol. 25 Issue 3, p1-30, 30p

Single machine lot scheduling to minimize maximum weighted completion time.

Authors: Zheng, Feifeng Li, Na Liu, Ming et al.

Source: Journal of Combinatorial Optimization; Aug2025, Vol. 50 Issue 1, p1-36, 36p

A hybrid scatter search method for solving fuzzy no-wait flow-shop scheduling problems.

Authors: Başar, Ramazan Engin, Orhan

Source: Engineering Optimization; Jul2025, Vol. 57 Issue 7, p1693-1726, 34p

Subject Terms: FLOW shop scheduling, SETUP time, MATHEMATICAL optimization, CUSTOMER satisfaction, BENCHMARK problems (Computer science), OPTIMIZATION algorithms, ALGORITHMS

Optimally rescheduling jobs with a LIFO buffer

Authors: Nicosia, Gaia Pacifici, Andrea Pferschy, Ulrich et al.

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2106.15901

COMPUTING AREA IN PRESENTATIONS OF THE TRIVIAL GROUP.

Authors: RILEY, TIMOTHY

Source: Proceedings of the American Mathematical Society; Dec2017, Vol. 145 Issue 12, p5059-5069, 11p, 1 Color Photograph

Subject Terms: POLYNOMIAL time algorithms, LIQUID crystals, RNA folding, HOMOTOPY theory, DETERMINISTIC algorithms

Two-agent scheduling on mixed batch machines to minimise the total weighted makespan.

Authors: Fan, Guo-Qiang Wang, Jun-Qiang Liu, Zhixin

Source: International Journal of Production Research; Jan 2023, Vol. 61 Issue 1, p238-257, 20p, 1 Diagram, 6 Charts, 5 Graphs, 1 Map

Subject Terms: BATCH processing, PRODUCTION scheduling, APPROXIMATION algorithms, SCHEDULING, MACHINERY

Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties.

Authors: Geng, Zhichao Lu, Lingfa

Source: Journal of Combinatorial Optimization; Mar2025, Vol. 49 Issue 2, p1-27, 27p

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs.

Authors: Shen, Siqian Smith, J. Cole

Source: Networks; Sep2012, Vol. 60 Issue 2, p103-119, 17p

Algorithms for optimizing cross-overs in DNA shuffling.

Authors: Lu He Friedman, Alan M. Bailey-Kellogg, Chris

Source: BMC Bioinformatics; 2012 Supplement 3, Vol. 13 Issue Suppl 3, p1-14, 14p, 3 Diagrams, 9 Graphs

Subject Terms: ALGORITHMS, DNA, CHIMERISM, HOMOLOGY (Biology), STOCHASTIC processes, DNA polymerases, AMINO acids