Search Results - "NP-hard problems"

The Complexity of Computing KKT Solutions of Quadratic Programs.

Authors: Fearnley, John Goldberg, Paul Hollender, Alexandros et al.

Source: Journal of the ACM. Oct2025, Vol. 72 Issue 5, p1-48. 48p.

Subject Terms: QUADRATIC programming, NP-hard problems, OPTIMIZATION algorithms, COMPUTATIONAL complexity, NONCONVEX programming

An adaptive large neighborhood search method for the AGV scheduling problem with a limited number of chargers.

Authors: Li, Yantong Ren, Bo Wen, Xin et al.

Source: International Journal of Production Research. Aug2025, Vol. 63 Issue 15, p5749-5781. 33p.

Subject Terms: *SCHEDULING, *MATHEMATICAL optimization, *ARTIFICIAL intelligence, *INDUSTRIAL applications, NP-hard problems, METAHEURISTIC algorithms, MIXED integer linear programming

Multi-period fourth-party logistics network design from the viability perspective: a collaborative hyper-heuristic embedded with double-layer Q-learning algorithm.

Authors: Zhang, Yuxin Huang, Min Gao, Zheming 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

Distributed maintenance task scheduling for multiple technician teams considering uncertain durations and deterioration effects towards Industry 5.0.

Authors: Lu, Shaojun Chen, Yubei Zheng, Rui 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

A New Project Scheduling Problem with Worker-Dependent Durations.

Authors: Choi, Byung-Cheon Chung, Jibok

Source: Asia-Pacific Journal of Operational Research. Oct2025, Vol. 42 Issue 5, p1-12. 12p.

Subject Terms: *PROJECT management, *WORK structure, *PRODUCTION scheduling, NP-hard problems, ASSIGNMENT problems (Programming), POLYNOMIAL time algorithms

An improved compact formulation for the assortment optimization problem with small consideration sets.

Authors: Roberti, Roberto Salvagnin, Domenico Fischetti, Matteo

Source: Journal of the Operational Research Society. Oct2025, Vol. 76 Issue 10, p2060-2070. 11p.

Subject Terms: *MATHEMATICAL optimization, *DISCRETE choice models, *SIMULATION methods & models, MIXED integer linear programming, NP-hard problems, CHOICE (Psychology), SUBSET selection

Total Completion Time Scheduling Under Scenarios.

Authors: Bosman, Thomas van Ee, Martijn Ergen, Ekin 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

Scheduling on parallel dedicated machines with job rejection.

Authors: Mor, Baruch Mosheiov, Gur

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

A critical review of selective maintenance for mission-oriented systems: challenges and a roadmap for novel contributions.

Authors: Al-Jabouri, Hamzea Saif, Ahmed Khatab, Abdelhakim et al.

Source: International Journal of Production Research. Jul2024, Vol. 62 Issue 13, p4980-5015. 36p.

Subject Terms: *MATHEMATICAL models, NP-hard problems

The Days On Days Off Scheduling Problem.

Authors: Nießen, Fabien Paschmanns, Paul

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

Hardness of Pricing Routes for Two-Stage Stochastic Vehicle Routing Problems with Scenarios.

Authors: Ota, Matheus J. Fukasawa, Ricardo

Source: Operations Research. Jul/Aug2025, Vol. 73 Issue 4, p2177-2187. 11p.

Subject Terms: *MATHEMATICAL optimization, *STOCHASTIC models, *COLUMN generation (Algorithms), VEHICLE routing problem, NP-hard problems, STOCHASTIC programming, COMBINATORIAL optimization

Two-agent scheduling with time-dependent and position-dependent in a flow-shop system.

Authors: Miao, Cuixia Wu, Haoran Hu, Jiaming

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

Unbounded parallel-batch scheduling to minimize the total weighted tardy span.

Authors: Chen, Shuaiyi Chen, Rubing Yuan, Jinjiang 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

The mixed integer trust region problem.

Authors: Del Pia, Alberto¹ (AUTHOR) delpia@wisc.edu

Source: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p699-736. 38p.

Subject Terms: *NONLINEAR programming, *MATHEMATICAL optimization, *INTEGER programming, NP-hard problems, POLYNOMIAL time algorithms, INTEGERS, QUADRATIC forms, QUADRATIC programming

Single‐Machine Scheduling to Minimize the Size of Input Buffer.

Authors: Tanaka, Shunji Lin, Bertrand M. T.

Source: Naval Research Logistics. Sep2025, Vol. 72 Issue 6, p810-824. 15p.

Subject Terms: *DYNAMIC programming, *HEURISTIC, *EMPIRICAL research, NP-hard problems, MIXED integer linear programming, BUFFER storage (Computer science), COMPUTER scheduling, HEURISTIC algorithms

Non-Resumable Scheduling on a Single Bounded Parallel-Batch Machine with Flexible Maintenance.

Authors: Fan, Jing¹ (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

The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings.

Authors: Liu, Xiaofei Li, Weidong

Source: International Journal of Foundations of Computer Science. Aug2025, Vol. 36 Issue 5, p767-780. 14p.

Subject Terms: *MATHEMATICAL optimization, GRAPH theory, NP-hard problems, APPROXIMATION algorithms, STAR graphs (Graph theory)

Scheduling step-deteriorating jobs on a single machine with multiple critical dates.

Authors: Choi, Byung-Cheon Kim, Eun-Seok Lee, Jun-Ho

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

Single Machine Scheduling with a Restricted Weight-Modifying Activity to Minimize the Weighted Makespan.

Authors: Zuo, Lili Lu, Lingfa Zhang, Liqi

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

Exact and approximation algorithms for covering timeline in temporal graphs.

Authors: Dondi, Riccardo Popa, Alexandru

Source: Annals of Operations Research. Aug2025, Vol. 351 Issue 1, p609-628. 20p.

Subject Terms: *ALGORITHMS, *MATHEMATICAL optimization, NP-hard problems, APPROXIMATION algorithms, PARAMETERIZATION, GRAPH theory, TIME-varying networks