Search Results - "NP-hard problems"
-
1
Authors: et al.
Source: Journal of the ACM. Oct2025, Vol. 72 Issue 5, p1-48. 48p.
-
2
Authors: et al.
Source: International Journal of Production Research. Aug2025, Vol. 63 Issue 15, p5749-5781. 33p.
-
3
Authors: et al.
Source: International Journal of Production Research. May2025, Vol. 63 Issue 9, p3300-3330. 31p.
Subject Terms: *THIRD-party logistics, *INTEGER programming, NP-hard problems, SATISFACTION, FORTIFICATION
-
4
Authors: et al.
Source: International Journal of Production Research. Feb2025, p1-25. 25p. 11 Illustrations.
Subject Terms: *MANUFACTURING processes, *PROBABILITY theory, *SCHEDULING, NP-hard problems, TIME measurements
-
5
Authors:
Source: Asia-Pacific Journal of Operational Research. Oct2025, Vol. 42 Issue 5, p1-12. 12p.
-
6
Authors:
Source: Journal of the Operational Research Society. Oct2025, Vol. 76 Issue 10, p2060-2070. 11p.
-
7
Authors: et al.
Source: Theory of Computing Systems. Dec2025, Vol. 69 Issue 4, p1-41. 41p.
Subject Terms: *SCHEDULING, *UNCERTAINTY (Information theory), NP-hard problems, PARALLEL computers, POSSIBILITY
-
8
Authors:
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
-
9
Authors: et al.
Source: International Journal of Production Research. Jul2024, Vol. 62 Issue 13, p4980-5015. 36p.
Subject Terms: *MATHEMATICAL models, NP-hard problems
-
10
Authors:
Source: European Journal of Operational Research. Feb2026, Vol. 329 Issue 1, p79-86. 8p.
Subject Terms: *HOSPITALITY industry, *LABOR supply, *ALGORITHMS, *SCHEDULING, NP-hard problems, COMPUTATIONAL complexity, SCHOLARLY method
-
11
Authors:
Source: Operations Research. Jul/Aug2025, Vol. 73 Issue 4, p2177-2187. 11p.
-
12
Authors:
Source: RAIRO: Operations Research (2804-7303). 2025, Vol. 59 Issue 5, p3253-3265. 13p.
Subject Terms: *SCHEDULING, *FLOW shop scheduling, *RESOURCE allocation, NP-hard problems
-
13
Authors: et al.
Source: Journal of Industrial & Management Optimization. Aug2025, Vol. 21 Issue 8, p1-20. 20p.
Subject Terms: *SCHEDULING, *PARALLEL processing, *DEADLINES, *TIME management, NP-hard problems, TIME measurements, APPROXIMATION algorithms, COMPUTER simulation
-
14
Authors: Del Pia, Alberto1 (AUTHOR) delpia@wisc.edu
Source: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p699-736. 38p.
-
15
Authors:
Source: Naval Research Logistics. Sep2025, Vol. 72 Issue 6, p810-824. 15p.
-
16
Authors: Fan, Jing1 (AUTHOR) sspu_fj@163.com
Source: International Journal of Foundations of Computer Science. Aug2025, Vol. 36 Issue 5, p827-840. 14p.
Subject Terms: *SCHEDULING, *BATCH processing, NP-hard problems, APPROXIMATION algorithms
-
17
Authors:
Source: International Journal of Foundations of Computer Science. Aug2025, Vol. 36 Issue 5, p767-780. 14p.
-
18
Authors:
Source: Journal of the Operational Research Society. Aug2025, Vol. 76 Issue 8, p1553-1563. 11p.
Subject Terms: *SCHEDULING, *HEURISTIC, *DEADLINES, NP-hard problems, MIXED integer linear programming
-
19
Authors:
Source: International Journal of Foundations of Computer Science. Sep2025, p1-15. 15p.
Subject Terms: *SCHEDULING, *DYNAMIC programming, NP-hard problems, APPROXIMATION algorithms, POLYNOMIAL time algorithms
-
20
Authors:
Source: Annals of Operations Research. Aug2025, Vol. 351 Issue 1, p609-628. 20p.
Full Text Finder
Nájsť tento článok vo Web of Science