Search Results - pseudo-polynomial ((dynamic OR dynamika) OR dynamik) 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

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

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 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

Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem

Authors: Aringhieri, Roberto Grosso, Andrea Hosteins, Pierre et al.

Source: Discrete Applied Mathematics. 253:103-121

Subject Terms: Critical Node Problem, Connectivity measure, Shortest paths, Dynamic programming, Polynomial time algorithms, 0211 other engineering and technologies, Connectivity measure, Critical Node Problem, Dynamic programming, Polynomial time algorithms, Shortest paths, Discrete Mathematics and Combinatorics, Applied Mathematics, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences

File Description: application/pdf

Access URL: https://iris.polito.it/handle/11583/2698736
https://iris.unito.it/handle/2318/1662827
https://dblp.uni-trier.de/db/journals/dam/dam253.html#AringhieriGHS19
https://www.sciencedirect.com/science/article/abs/pii/S0166218X18300039

The K$K$‐prize‐collecting coverage problem by aligned disks.

Authors: Zhang, Hao Zheng, Xiya Liu, Zhonghao et al.

Source: International Transactions in Operational Research. Jan2025, p1. 21p. 8 Illustrations.

Subject Terms: *DYNAMIC programming, *ALGORITHMS, POLYNOMIAL time algorithms, POLYNOMIAL approximation, POINT set theory

基于松弛工期的总加权误工单机双代理排序问题. (Chinese)

Alternate Title: Single two-agent scheduling problems with slack due date to minimize the total weighted tardiness. (English)

Authors: 崔同欣 夏倩 张新

Source: Operations Research Transactions / Yunchouxue Xuebao; Mar2025, Vol. 29 Issue 1, p31-40, 10p

Subject Terms: TIME complexity, TARDINESS, DYNAMIC programming, ALGORITHMS, SCHEDULING

Single-Machine Rescheduling with Rejection and an Operator No-Availability Period.

Authors: Wu, Guanghua Zhu, Hongli

Source: Mathematics (2227-7390); Dec2024, Vol. 12 Issue 23, p3678, 10p

Subject Terms: PRODUCTION scheduling, POLYNOMIAL time algorithms, POLYNOMIAL approximation, DYNAMIC programming, TARDINESS

Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications.

Authors: Szkaliczki, Tibor

Source: Mathematics (2227-7390); Apr2025, Vol. 13 Issue 7, p1097, 35p

Subject Terms: DYNAMIC programming, COMBINATORIAL optimization, OPERATIONS research, PROBLEM solving, KNAPSACK problems, HEURISTIC