Výsledky vyhledávání - "pseudo-polynomial dynamic 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

Single machine scheduling with discretely controllable processing times

Autoři: Zhi-Long Chen Qing Lu Guochun Tang

Zdroj: Operations Research Letters. 21:69-76

Témata: total completion time, controllable processing times, Deterministic scheduling theory in operations research, single machine, maximum tardiness, 0211 other engineering and technologies, makespan, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, Dynamic programming, sum of the total processing cost, pseudo-polynomial dynamic programming algorithms

Popis souboru: application/xml

Přístupová URL adresa: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.7806
https://dblp.uni-trier.de/db/journals/orl/orl21.html#ChenLT97
https://www.sciencedirect.com/science/article/pii/S0167637797000102

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

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

Minsum scheduling with acceptable lead-times and optional job rejection.

Autoři: Mor, Baruch Shapira, Dana

Zdroj: Optimization Letters; Apr2022, Vol. 16 Issue 3, p1073-1091, 19p

A note: flowshop scheduling with linear deterioration and job-rejection.

Autoři: Mor, Baruch Mosheiov, Gur

Zdroj: 4OR (1619-4500); Mar2021, Vol. 19 Issue 1, p103-111, 9p

Single machine lot scheduling with optional job-rejection.

Autoři: Mor, Baruch Mosheiov, Gur Shapira, Dana

Zdroj: Journal of Combinatorial Optimization; 2021, Vol. 41 Issue 1, p1-11, 11p

Single-machine scheduling with setup time: a case study in the cutting of large-scale structural parts.

Autoři: Zheng, Peng Guo, Peng Wang, Yakun a další

Zdroj: Engineering Optimization; Oct2025, Vol. 57 Issue 10, p2675-2700, 26p

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

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

Single-machine common due date total earliness/tardiness scheduling with machine unavailability.

Autoři: Bülbül, Kerem Kedad-Sidhoum, Safia Şen, Halil

Zdroj: Journal of Scheduling; Oct2019, Vol. 22 Issue 5, p543-565, 23p

Témata: TARDINESS, MACHINING, DYNAMIC programming

Scheduling on proportionate flowshop with total late work and job rejection.

Autoři: Geng, Xin-Na Sun, Xinyu Wang, Jiayin a další

Zdroj: Operational Research; Sep2025, Vol. 25 Issue 3, p1-30, 30p

Research on two-machine flow shop scheduling problem with release dates and truncated learning effects.

Autoři: Lv, Dan-Yang Wang, Ji-Bo

Zdroj: Engineering Optimization; Jul2025, Vol. 57 Issue 7, p1828-1848, 21p

Témata: SCHEDULING, FLOW shops, NP-hard problems, SIMULATED annealing, HEURISTIC algorithms, OPTIMIZATION algorithms

A two-agent single-machine scheduling problem with late work criteria.

Autoři: Wang, Du-Juan Kang, Chao-Chung Shiau, Yau-Ren a další

Zdroj: Soft Computing - A Fusion of Foundations, Methodologies & Applications; Apr2017, Vol. 21 Issue 8, p2015-2033, 19p

Témata: SCHEDULING, ALGORITHMS, DYNAMIC programming, MATHEMATICAL programming, SOFT computing

Single-machine and flow-shop scheduling with supporting tasks in a nested structure

Autoři: Renjie Yu Daniel Oron Bertrand M. T. Lin

Zdroj: Journal of Scheduling.

CON/ SLK due date assignment and scheduling on a single machine with two agents.

Autoři: Yin, Yunqiang Wang, Du‐Juan Wu, Chin‐Chia a další

Zdroj: Naval Research Logistics; Aug2016, Vol. 63 Issue 5, p416-429, 29p

Témata: SCHEDULING, INTERVAL measurement, TIME management, WORK-life balance, PROGRESS reports

Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work.

Autoři: Yin, Yunqiang Xu, Jianyou Cheng, T. C. E. a další

Zdroj: Naval Research Logistics; Mar2016, Vol. 63 Issue 2, p172-183, 25p

Témata: APPROXIMATION theory, PRODUCTION scheduling, POLYNOMIALS, DYNAMIC programming, NAVAL logistics

Two-agent scheduling with agent specific batches on an unbounded serial batching machine.

Autoři: Kovalyov, Mikhail Oulamara, Ammar Soukhal, Ameur

Zdroj: Journal of Scheduling; Aug2015, Vol. 18 Issue 4, p423-434, 12p

Témata: PRODUCTION scheduling, FLOW shop scheduling, TIME management, POLYNOMIALS, ALGORITHMS

Mathematical Models and Optimal Algorithms for Lot Scheduling Considering Job Splitting and Due Dates in Green Logistics.

Autoři: Liu, Ming Liu, Zhongzheng Zheng, Feifeng a další

Zdroj: Asia-Pacific Journal of Operational Research; Oct2024, Vol. 41 Issue 5, p1-25, 25p

Témata: MIXED integer linear programming, MATHEMATICAL programming, PROCESS capability, TARDINESS, INDUSTRIAL costs, ECONOMIC lot size, JOB shops, PRODUCTION quantity

Multi-agent scheduling problems under multitasking.

Autoři: Wang, Dujuan Yu, Yugang Yin, Yunqiang a další

Zdroj: International Journal of Production Research; Jun2021, Vol. 59 Issue 12, p3633-3663, 31p, 5 Charts

Témata: SCHEDULING, CLOUD computing, COMPUTATIONAL complexity, DYNAMIC programming