Výsledky vyhľadávania - pseudo-polynomial (dynamic OR dynamika) programming algorithms~

Scheduling on parallel dedicated machines with job rejection.

Autori: Mor, Baruch Mosheiov, Gur

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

Predmety: *DYNAMIC programming, *PRODUCTION scheduling, NP-hard problems, TARDINESS, PARALLEL algorithms

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

Autori: Kong, Fanyu Zhang, Yuzhong

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

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

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

Autori: Phosavanh, Johnson Oron, Daniel

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

Predmety: *DYNAMIC programming, *PRODUCTION scheduling, *UNEMPLOYMENT, *PROBLEM solving, *ALGORITHMS

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

Autori: Phosavanh, Johnson Oron, Daniel

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

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

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

Autori: Shinji IMAHORI Yoshiyuki KARUNO Kenju TATEISHI

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

Predmety: 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 súboru: electronic resource

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

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

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

Autori: Li, Shi-Sheng Sang, Yao-Wen Chen, Ren-Xia a ďalší

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

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

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

Autori: Lin, B. M. T.

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

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

Resource-Aware Taxon Selection for Maximizing Phylogenetic Diversity

Autori: Pardi, Fabio Goldman, Nick

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

Prístupová URL adresa: https://www.jstor.org/stable/20143048

The unbounded parallel-batch scheduling with rejection

Autori: Zhang, LQ Lu, LF Ng, CT

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

Prístupová URL adresa: https://www.jstor.org/stable/41353931

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.

Autori: Li, Kai Xie, Fulong Chen, Jianfu a ďalší

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

Predmety: SETUP time, VARIABLE costs, HEURISTIC programming, HEURISTIC algorithms, ARTIFICIAL intelligence

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

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

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

Predmety: REINFORCEMENT learning, TARDINESS, DYNAMIC programming, MACHINE learning, MANUFACTURING processes

Knapsack problems with position-dependent item weights or profits.

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

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

Predmety: KNAPSACK problems, DYNAMIC programming, PROBLEM solving, BACKPACKS, ALGORITHMS

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

Autori: Li, S-S Sang, Y-W Chen, R-X a ďalší

Predmety: 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 súboru: text

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

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

Autori: Harbering, Jonas Ranade, Abhiram Schmidt, Marie a ďalší

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

Predmety: *DYNAMIC programming, *SYSTEMS engineering

The G4-Heuristic for the Pallet Loading Problem

Autori: Scheithauer, Guntram Terno, Johannes

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

Prístupová URL adresa: https://www.jstor.org/stable/3010727

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

Autori: Mosheiov, Gur Oron, Daniel Shabtay, Dvir

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

Predmety: *DYNAMIC programming, *MACHINERY, POLYNOMIAL time algorithms

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

Autori: Nicosia, Gaia Pacifici, Andrea Pferschy, Ulrich a ďalší

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

Predmety: DYNAMIC programming, UNEMPLOYMENT statistics, ALGORITHMS, OCCUPATIONAL mobility, TARDINESS

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

Autori: Mor, Baruch Mosheiov, Gur

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

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

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

Autori: Qi Wei Yong Wu

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

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

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

Autori: Harbering, Jonas Ranade, Abhiram Schmidt, Marie a ďalší

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émy: dk/atira/pure/keywords/researchprograms/AFL000700/RSMLIS; name=RSM LIS, article

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