Search Results - pseudo-polynomial dynamic programming algorithms

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: *DYNAMIC programming, *PRODUCTION scheduling, NP-hard problems, TARDINESS, PARALLEL 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: *DYNAMIC programming, *MATHEMATICAL optimization, KNAPSACK problems, MATHEMATICAL functions, APPROXIMATION algorithms, MONOTONIC functions, EXPONENTIAL functions

Dynamic programming algorithms for producing food mixture packages by automatic combination weighers

Authors: Shinji IMAHORI Yoshiyuki KARUNO Kenju TATEISHI

Source: Journal of Advanced Mechanical Design, Systems, and Manufacturing, Vol 8, Iss 5, Pp JAMDSM0065-JAMDSM0065 (2014)

Subject Terms: engineering optimization, food packaging, 0-1 integer programming, dynamic programming, pseudo-polynomial time algorithms, Engineering machinery, tools, and implements, TA213-215, Mechanical engineering and machinery, TJ1-1570

File Description: electronic resource

Relation: https://www.jstage.jst.go.jp/article/jamdsm/8/5/8_2014jamdsm0065/_pdf/-char/en; https://doaj.org/toc/1881-3054

Access URL: https://doaj.org/article/ed0eaa0586944afe93103062a2fc9bb9

Two-agent single-machine scheduling with a rate-modifying activity.

Authors: Phosavanh, Johnson Oron, Daniel

Source: European Journal of Operational Research. Feb2024, Vol. 312 Issue 3, p866-876. 11p.

Subject Terms: *DYNAMIC programming, *SCHEDULING, *PRODUCTION scheduling, *PROBLEM solving, *SHARING economy, POLYNOMIAL time algorithms

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

Complexity, bounds and dynamic programming algorithms for single track train scheduling

Authors: Jonas Harbering Abhiram Ranade Marie Schmidt et al.

Contributors: Jonas Harbering Abhiram Ranade Marie Schmidt et al.

Source: Annals of Operations Research. 273:479-500

Subject Terms: 0211 other engineering and technologies, RSM LIS, 02 engineering and technology

Access URL: https://pure.eur.nl/en/publications/f0f9af9e-321f-4fe6-ab59-acfe2b59dc3d
https://doi.org/10.1007/s10479-017-2644-7
https://dblp.uni-trier.de/db/journals/anor/anor273.html#HarberingRSS19
https://repub.eur.nl/pub/102271
https://ideas.repec.org/a/spr/annopr/v273y2019i1d10.1007_s10479-017-2644-7.html
https://link.springer.com/article/10.1007/s10479-017-2644-7
https://resolver.sub.uni-goettingen.de/purl?gro-2/62259

Minimizing total late work on a single machine with generalized due-dates.

Authors: Mosheiov, Gur Oron, Daniel Shabtay, Dvir

Source: European Journal of Operational Research. Sep2021, Vol. 293 Issue 3, p837-846. 10p.

Subject Terms: *DYNAMIC programming, *MACHINERY, POLYNOMIAL time algorithms

Complexity, bounds and dynamic programming algorithms for single track train scheduling

Authors: Harbering, Jonas Ranade, Abhiram Schmidt, Marie et al.

Source: Harbering, J, Ranade, A, Schmidt, M & Sinnen, O 2017, 'Complexity, bounds and dynamic programming algorithms for single track train scheduling', Annals of Operations Research, vol. 273, no. 1-2, pp. 479-500.

Index Terms: dk/atira/pure/keywords/researchprograms/AFL000700/RSMLIS; name=RSM LIS, article

URL: https://pure.eur.nl/en/publications/f0f9af9e-321f-4fe6-ab59-acfe2b59dc3d

Knapsack problems with position-dependent item weights or profits.

Authors: Gawiejnowicz, Stanisław Halman, Nir Kellerer, Hans

Source: Annals of Operations Research; Jul2023, Vol. 326 Issue 1, p137-156, 20p

Subject Terms: KNAPSACK problems, DYNAMIC programming, PROBLEM solving, BACKPACKS, ALGORITHMS

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

Authors: Li, S-S Sang, Y-W Chen, R-X et al.

Subject Terms: dynamic programming, SCHEDULING PROBLEM, Disjoint sets, Two-agent, Scheduling, Two agents, Work-related, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, Job shop scheduling, Scheduling algorithms, Single- machines, Assignable due dates, Due dates, Single machine, Key feature, Predefined sets, Late work

File Description: text

Access URL: https://eprints.sztaki.hu/10920/

Due-Date assignment with acceptable lead-times on parallel machines.

Authors: Mor, Baruch Mosheiov, Gur

Source: Computers & Operations Research. Jun2024, Vol. 166, pN.PAG-N.PAG. 1p.

Subject Terms: *DYNAMIC programming, *LEAD time (Supply chain management), NP-hard problems, PARALLEL algorithms, TARDINESS

Mathematical models and an effective exact algorithm for unrelated parallel machine scheduling with family setup times and machine cost: Mathematical models and an effective exact...: K. Li et al.

Authors: Li, Kai Xie, Fulong Chen, Jianfu et al.

Source: OR Spectrum; Mar2025, Vol. 47 Issue 1, p129-176, 48p

Subject Terms: SETUP time, VARIABLE costs, HEURISTIC programming, HEURISTIC algorithms, ARTIFICIAL intelligence

Deep Q-Networks for Minimizing Total Tardiness on a Single Machine †.

Authors: Huang, Kuan Wei Lin, Bertrand M. T.

Source: Mathematics (2227-7390); Jan2025, Vol. 13 Issue 1, p62, 22p

Subject Terms: REINFORCEMENT learning, TARDINESS, DYNAMIC programming, MACHINE learning, MANUFACTURING processes

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

Single machine scheduling with assignable due dates to minimize maximum and total late work.

Authors: Justkowiak, Jan-Erik Kovalev, Sergey Kovalyov, Mikhail Y. et al.

Source: European Journal of Operational Research. Jul2023, Vol. 308 Issue 1, p76-83. 8p.

Subject Terms: *DYNAMIC programming, *SCHEDULING, *MACHINERY, *PROBLEM solving

Two-Machine Hybrid Flow-Shop Problems in Shared Manufacturing.

Authors: Qi Wei Yong Wu

Source: Computer Modeling in Engineering & Sciences (CMES); 2022, Vol. 131 Issue 2, p1125-1146, 22p

Subject Terms: PRODUCTION scheduling, BRANCH & bound algorithms, DYNAMIC programming, CONTINUOUS processing, HEURISTIC algorithms, SEARCH algorithms

Complexity, bounds and dynamic programming algorithms for single track train scheduling.

Authors: Harbering, Jonas Ranade, Abhiram Schmidt, Marie et al.

Source: Annals of Operations Research; Feb2019, Vol. 273 Issue 1/2, p479-500, 22p

Subject Terms: DYNAMIC programming, SYSTEMS engineering

Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items.

Authors: Lalou, Mohammed Kheddouci, Hamamache

Source: Computers & Operations Research. Oct2023, Vol. 158, pN.PAG-N.PAG. 1p.

Subject Terms: *PROBLEM solving, *LINEAR programming, *DYNAMIC programming, *ALGORITHMS, KNAPSACK problems, DIRECTED graphs

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

Authors: Gaia Nicosia Andrea Pacifici Ulrich Pferschy et al.

Contributors: Gaia Nicosia Andrea Pacifici Ulrich Pferschy et al.

Source: Journal of Scheduling. 24:663-680

Subject Terms: 0209 industrial biotechnology, Settore MAT/09 - RICERCA OPERATIVA, Dynamic programming algorithm, Scheduling, Complexity, Dynamic programming algorithms, Rescheduling, Sequence coordination, Supply chain sustainability, 0211 other engineering and technologies, 02 engineering and technology, Settore MATH-06/A - Ricerca operativa, Settore IINF-05/A - Sistemi di elaborazione delle informazioni

File Description: application/pdf

Access URL: https://link.springer.com/content/pdf/10.1007/s10951-021-00707-5.pdf
https://dblp.uni-trier.de/db/journals/scheduling/scheduling24.html#NicosiaPPRR21
https://link.springer.com/article/10.1007%2Fs10951-021-00707-5
https://link.springer.com/content/pdf/10.1007/s10951-021-00707-5.pdf
https://hdl.handle.net/2434/870216
https://doi.org/10.1007/s10951-021-00707-5
https://hdl.handle.net/2108/304211
https://doi.org/10.1007/s10951-021-00707-5