Search Results - pseudo-polynomial ((dynamic OR dynamika) OR dynamika) programming algorithms*

Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems

Authors: Camille Grange Michael Poss Eric Bourreau et al.

Contributors: Camille Grange Michael Poss Eric Bourreau et al.

Source: European Journal of Operational Research. 320:516-526

Subject Terms: Quantum optimization, Quantum Physics, Dynamic Programming, Scheduling, 0211 other engineering and technologies, FOS: Physical sciences, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Grover algorithm, [INFO] Computer Science [cs], Quantum computing, Dynamic programming, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Discrete Optimization, Optimization and Control (math.OC), FOS: Mathematics, Quantum Physics (quant-ph), Mathematics - Optimization and Control, [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]

File Description: application/pdf

Access URL: http://arxiv.org/abs/2408.05741
https://hal.science/hal-04991094v1
https://hal.science/hal-04617682v3/document
https://doi.org/10.1016/j.ejor.2024.09.005
https://hal.science/hal-04617682v3
https://hal.science/hal-04380572v1

Scheduling on parallel dedicated machines with job rejection.

Authors: Mor, Baruch Mosheiov, Gur

Source: International Journal of Production Research; Oct2024, Vol. 62 Issue 19, p6933-6940, 8p

Subject Terms: NP-hard problems, DYNAMIC programming, PRODUCTION scheduling, TARDINESS, PARALLEL algorithms

Makespan Minimization in Single-Machine Scheduling with Step-Deterioration of Processing Times

Authors: Lin, B. M. T.

Source: The Journal of the Operational Research Society, 2004 Mar 01. 55(3), 247-256.

Access URL: https://www.jstor.org/stable/4102004

Resource-Aware Taxon Selection for Maximizing Phylogenetic Diversity

Authors: Pardi, Fabio Goldman, Nick

Source: Systematic Biology, 2007 Jun 01. 56(3), 431-444.

Access URL: https://www.jstor.org/stable/20143048

The unbounded parallel-batch scheduling with rejection

Authors: Zhang, LQ Lu, LF Ng, CT

Source: The Journal of the Operational Research Society, 2012 Mar 01. 63(3), 293-298.

Access URL: https://www.jstor.org/stable/41353931

Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges.

Authors: Li, Xiao Guan, Xiucui Jia, Junhua et al.

Source: Journal of Global Optimization; Aug2025, Vol. 92 Issue 4, p951-972, 22p

Subject Terms: TREES, NP-hard problems, MATHEMATICAL optimization, GREEDY algorithms, DYNAMIC programming, GRAPH algorithms

Knapsack Problems with Monotonically Non-Decreasing Variable Weights (Profits) of Items.

Authors: Kong, Fanyu Zhang, Yuzhong

Source: International Journal of Foundations of Computer Science. Jul2025, p1-12. 12p.

Subject Terms: *KNAPSACK problems, *DYNAMIC programming, *MATHEMATICAL functions, *APPROXIMATION algorithms, *MONOTONIC functions, *EXPONENTIAL functions, *MATHEMATICAL optimization

Single‐Machine Scheduling to Minimize the Size of Input Buffer.

Authors: Tanaka, Shunji Lin, Bertrand M. T.

Source: Naval Research Logistics; Sep2025, Vol. 72 Issue 6, p810-824, 15p

Subject Terms: NP-hard problems, MIXED integer linear programming, BUFFER storage (Computer science), DYNAMIC programming, HEURISTIC, COMPUTER scheduling, HEURISTIC algorithms, EMPIRICAL research

W-prize-collecting with release dates on a single machine.

Authors: Sun, Ruiqing¹ (AUTHOR) ruiqing2020@126.com

Source: Journal of Industrial & Management Optimization. Jan2025, Vol. 21 Issue 1, p1-14. 14p.

Subject Terms: *DYNAMIC programming, POLYNOMIAL time algorithms, APPROXIMATION algorithms, POLYNOMIAL approximation, NP-hard problems

The G4-Heuristic for the Pallet Loading Problem

Authors: Scheithauer, Guntram Terno, Johannes

Source: The Journal of the Operational Research Society, 1996 Apr 01. 47(4), 511-522.

Access URL: https://www.jstor.org/stable/3010727

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

Lot scheduling on a single machine to minimize total weighted completion time.

Authors: Zheng, Feifeng Li, Na Xu, Yinfeng et al.

Source: RAIRO: Operations Research (2804-7303); 2025, Vol. 59 Issue 5, p3153-3167, 15p

Subject Terms: SCHEDULING, PRODUCTION scheduling, POLYNOMIAL time algorithms, NP-hard problems, MANUFACTURING processes, DYNAMIC programming

A note on scheduling identical parallel machines with preemptions and setup times.

Authors: Boudhar, Mourad Dolgui, Alexandre Haned, Amina et al.

Source: International Journal of Production Research; Feb2025, Vol. 63 Issue 3, p1203-1208, 6p

Subject Terms: SETUP time, DYNAMIC programming, COMPUTATIONAL complexity, PRODUCTION scheduling, NP-hard problems, ECONOMIC lot size

Single machine scheduling with a restricted rate-modifying activity to minimize the weighted makespan.

Authors: Zuo, Lili Zhang, Jing Shi, Zhan et al.

Source: Discrete Applied Mathematics. Feb2026, Vol. 380, p89-100. 12p.

Subject Terms: *NP-hard problems, *PRODUCTION scheduling, *ALGORITHMS, *APPROXIMATION algorithms, *SCHEDULING, *DYNAMIC programming

Single Machine Scheduling with a Restricted Weight-Modifying Activity to Minimize the Weighted Makespan.

Authors: Zuo, Lili Lu, Lingfa Zhang, Liqi

Source: International Journal of Foundations of Computer Science. Sep2025, p1-15. 15p.

Subject Terms: *NP-hard problems, *SCHEDULING, *DYNAMIC programming, *APPROXIMATION algorithms, *POLYNOMIAL time algorithms

Reinforcement learning and stochastic dynamic programming for jointly scheduling jobs and preventive maintenance on a single machine to minimise earliness-tardiness.

Authors: Sabri, Abderrazzak Allaoui, Hamid Souissi, Omar

Source: International Journal of Production Research; Feb2024, Vol. 62 Issue 3, p705-719, 15p

Subject Terms: STOCHASTIC programming, DYNAMIC programming, REINFORCEMENT learning, DEEP reinforcement learning, ADVANCED planning & scheduling, STATISTICAL learning, SCHOOL schedules

Minimising the makespan on parallel identical machines with log-linear position-dependent processing times.

Authors: Cohen, Edut Shapira, Dana

Source: Journal of the Operational Research Society; Mar2025, Vol. 76 Issue 3, p581-589, 9p

Subject Terms: POLYNOMIAL time algorithms, POLYNOMIAL approximation, PRODUCTION scheduling, DYNAMIC programming, NP-hard problems

Scheduling problems on parallel machines with machine-dependent generalized due-dates.

Authors: Mor, Baruch Mosheiov, Gur Shabtay, Dvir

Source: Annals of Operations Research. Apr2025, Vol. 347 Issue 3, p1455-1471. 17p.

Subject Terms: *NP-hard problems, *DYNAMIC programming, *TARDINESS, *SCHEDULING, *HARDNESS

Rescheduling with New Orders Under Bounded Disruption.

Authors: Lendl, Stefan Pferschy, Ulrich Rener, Elena

Source: INFORMS Journal on Computing; Nov/Dec2024, Vol. 36 Issue 6, p1654-1675, 22p

Subject Terms: POLYNOMIAL time algorithms, APPROXIMATION algorithms, POLYNOMIAL approximation, SEARCH algorithms, DYNAMIC programming, COMPUTER scheduling

Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong's Learning Effect.

Authors: Gao, Jie Zou, Juan Zhang, Yuzhong

Source: International Journal of Foundations of Computer Science; Aug2025, Vol. 36 Issue 5, p635-648, 14p

Subject Terms: LEARNING curve, SCHEDULING, TARDINESS, PROCESS optimization, DYNAMIC programming