Výsledky vyhledávání - pseudo-polynomial ((dynamic OR dynamika) OR dynamik) programming algorithms~

Scheduling on parallel dedicated machines with job rejection.

Autoři: Mor, Baruch Mosheiov, Gur

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

Témata: NP-hard problems, DYNAMIC programming, PRODUCTION scheduling, TARDINESS, PARALLEL algorithms

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

Autoři: Kong, Fanyu Zhang, Yuzhong

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

Témata: *KNAPSACK problems, *DYNAMIC programming, *MATHEMATICAL functions, *APPROXIMATION algorithms, *MONOTONIC functions, *EXPONENTIAL functions, *MATHEMATICAL optimization

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

Autoři: Phosavanh, Johnson Oron, Daniel

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

Témata: *DYNAMIC programming, *PRODUCTION scheduling, *UNEMPLOYMENT, *PROBLEM solving, *ALGORITHMS

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

Autoři: Li, Shi-Sheng Sang, Yao-Wen Chen, Ren-Xia a další

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

Témata: *WORKING hours, *DYNAMIC programming, *ALGORITHMS, POLYNOMIAL time algorithms, TARDINESS

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

Autoři: Phosavanh, Johnson Oron, Daniel

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

Témata: *DYNAMIC programming, *SCHEDULING, *PRODUCTION scheduling, *PROBLEM solving, *SHARING economy, POLYNOMIAL time algorithms

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

Autoři: Shinji IMAHORI Yoshiyuki KARUNO Kenju TATEISHI

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

Témata: 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

Popis souboru: electronic resource

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

Přístupová URL adresa: https://doaj.org/article/ed0eaa0586944afe93103062a2fc9bb9

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.

Autoři: Li, Kai Xie, Fulong Chen, Jianfu a další

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

Témata: SETUP time, VARIABLE costs, HEURISTIC programming, HEURISTIC algorithms, ARTIFICIAL intelligence

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

Autoři: Huang, Kuan Wei Lin, Bertrand M. T.

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

Témata: REINFORCEMENT learning, TARDINESS, DYNAMIC programming, MACHINE learning, MANUFACTURING processes

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

Autoři: Li, S-S Sang, Y-W Chen, R-X a další

Témata: 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

Popis souboru: text

Přístupová URL adresa: https://eprints.sztaki.hu/10920/

Knapsack problems with position-dependent item weights or profits.

Autoři: Gawiejnowicz, Stanisław Halman, Nir Kellerer, Hans

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

Témata: KNAPSACK problems, DYNAMIC programming, PROBLEM solving, BACKPACKS, ALGORITHMS

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

Autoři: Harbering, Jonas Ranade, Abhiram Schmidt, Marie a další

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

Témata: *DYNAMIC programming, *SYSTEMS engineering

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

Autoři: Qi Wei Yong Wu

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

Témata: PRODUCTION scheduling, BRANCH & bound algorithms, DYNAMIC programming, CONTINUOUS processing, HEURISTIC algorithms, SEARCH algorithms

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

Autoři: Nicosia, Gaia Pacifici, Andrea Pferschy, Ulrich a další

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

Témata: DYNAMIC programming, UNEMPLOYMENT statistics, ALGORITHMS, OCCUPATIONAL mobility, TARDINESS

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

Autoři: Mosheiov, Gur Oron, Daniel Shabtay, Dvir

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

Témata: *DYNAMIC programming, *MACHINERY, POLYNOMIAL time algorithms

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

Autoři: Justkowiak, Jan-Erik Kovalev, Sergey Kovalyov, Mikhail Y. a další

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

Témata: *DYNAMIC programming, *SCHEDULING, *MACHINERY, *PROBLEM solving

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

Autoři: Mor, Baruch Mosheiov, Gur

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

Témata: *DYNAMIC programming, *LEAD time (Supply chain management), NP-hard problems, PARALLEL algorithms, TARDINESS

Scheduling on a proportionate flowshop to minimise total late work.

Autoři: Gerstl, Enrique Mor, Baruch Mosheiov, Gur

Zdroj: International Journal of Production Research; Jan2019, Vol. 57 Issue 2, p531-543, 13p, 2 Diagrams, 2 Charts

Témata: FLOW shop scheduling, PRODUCTION scheduling, JOB shops, SETUP time, NUMERICAL analysis

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

Autoři: Harbering, Jonas Ranade, Abhiram Schmidt, Marie a další

Zdroj: 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.

Témata: dk/atira/pure/keywords/researchprograms/AFL000700/RSMLIS; name=RSM LIS, article

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

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

Autoři: Gaia Nicosia Andrea Pacifici Ulrich Pferschy a další

Přispěvatelé: Gaia Nicosia Andrea Pacifici Ulrich Pferschy a další

Zdroj: Journal of Scheduling. 24:663-680

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: 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

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

Autoři: Lin, B. M. T.

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

Přístupová URL adresa: https://www.jstor.org/stable/4102004