Suchergebnisse - pseudo-polynomial (dynamic OR dynamik) programming algorithms

Scheduling on parallel dedicated machines with job rejection.

Autoren: Mor, Baruch Mosheiov, Gur

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

Schlagwörter: *DYNAMIC programming, *PRODUCTION scheduling, NP-hard problems, TARDINESS, PARALLEL algorithms

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

Autoren: Kong, Fanyu Zhang, Yuzhong

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

Schlagwörter: *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.

Autoren: Phosavanh, Johnson Oron, Daniel

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

Schlagwörter: *DYNAMIC programming, *PRODUCTION scheduling, *UNEMPLOYMENT, *PROBLEM solving, *ALGORITHMS

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

Autoren: Phosavanh, Johnson Oron, Daniel

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

Schlagwörter: *DYNAMIC programming, *SCHEDULING, *PRODUCTION scheduling, *PROBLEM solving, *SHARING economy, POLYNOMIAL time algorithms

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

Autoren: Shinji IMAHORI Yoshiyuki KARUNO Kenju TATEISHI

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

Schlagwörter: 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

Dateibeschreibung: electronic resource

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

Zugangs-URL: https://doaj.org/article/ed0eaa0586944afe93103062a2fc9bb9

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

Autoren: Li, Shi-Sheng Sang, Yao-Wen Chen, Ren-Xia et al.

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

Schlagwörter: *WORKING hours, *DYNAMIC programming, *ALGORITHMS, POLYNOMIAL time 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.

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

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

Schlagwörter: SETUP time, VARIABLE costs, HEURISTIC programming, HEURISTIC algorithms, ARTIFICIAL intelligence

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

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

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

Schlagwörter: REINFORCEMENT learning, TARDINESS, DYNAMIC programming, MACHINE learning, MANUFACTURING processes

Knapsack problems with position-dependent item weights or profits.

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

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

Schlagwörter: KNAPSACK problems, DYNAMIC programming, PROBLEM solving, BACKPACKS, ALGORITHMS

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

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

Schlagwörter: 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

Dateibeschreibung: text

Zugangs-URL: https://eprints.sztaki.hu/10920/

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

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

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

Schlagwörter: *DYNAMIC programming, *SYSTEMS engineering

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

Autoren: Mosheiov, Gur Oron, Daniel Shabtay, Dvir

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

Schlagwörter: *DYNAMIC programming, *MACHINERY, POLYNOMIAL time algorithms

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

Autoren: Nicosia, Gaia Pacifici, Andrea Pferschy, Ulrich et al.

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

Schlagwörter: DYNAMIC programming, UNEMPLOYMENT statistics, ALGORITHMS, OCCUPATIONAL mobility, TARDINESS

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

Autoren: Mor, Baruch Mosheiov, Gur

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

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

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

Autoren: Qi Wei Yong Wu

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

Schlagwörter: PRODUCTION scheduling, BRANCH & bound algorithms, DYNAMIC programming, CONTINUOUS processing, HEURISTIC algorithms, SEARCH algorithms

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

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

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

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

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

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

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

Schlagwörter: *DYNAMIC programming, *SCHEDULING, *MACHINERY, *PROBLEM solving

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

Autoren: Gaia Nicosia Andrea Pacifici Ulrich Pferschy et al.

Weitere Verfasser: Gaia Nicosia Andrea Pacifici Ulrich Pferschy et al.

Quelle: Journal of Scheduling. 24:663-680

Schlagwörter: 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

Dateibeschreibung: application/pdf

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

Scheduling on a proportionate flowshop to minimise total late work.

Autoren: Gerstl, Enrique Mor, Baruch Mosheiov, Gur

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

Schlagwörter: FLOW shop scheduling, PRODUCTION scheduling, JOB shops, SETUP time, NUMERICAL analysis

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

Autoren: Lalou, Mohammed Kheddouci, Hamamache

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

Schlagwörter: *PROBLEM solving, *LINEAR programming, *DYNAMIC programming, *ALGORITHMS, KNAPSACK problems, DIRECTED graphs