| Publication | Date of Publication | Type |
|---|
Unbounded parallel-batch scheduling to minimize the total weighted tardy span
Journal of Industrial and Management Optimization | 2026-02-26 | Paper |
Even cycles and perfect matchings in planar graphs
Discrete Applied Mathematics | 2025-11-04 | Paper |
Bicriterion parallel-machine scheduling of equal-length jobs to minimize total tardiness and number of tardy jobs
Journal of Combinatorial Optimization | 2025-10-22 | Paper |
Single-machine scheduling with positional deadlines, time deadlines, and due date assignment for minimizing total weighted tardiness
Naval Research Logistics | 2025-10-10 | Paper |
Sufficient conditions for k-factors and spanning trees of graphs
Discrete Applied Mathematics | 2025-06-19 | Paper |
Properly colored even cycles in edge-colored complete balanced bipartite graphs
Discrete Mathematics | 2025-06-12 | Paper |
Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work
European Journal of Operational Research | 2025-05-19 | Paper |
Claw-free minimal matching covered graphs
Discrete Applied Mathematics | 2025-04-28 | Paper |
Competition under demand uncertainty: the roles of technology and capacity strategy
European Journal of Operational Research | 2024-07-16 | Paper |
Operations strategy for a construction supply chain: modular integrated construction and blockchain adoption
International Transactions in Operational Research | 2024-06-25 | Paper |
Approximation algorithms for batch scheduling with processing set restrictions
Journal of Scheduling | 2024-04-02 | Paper |
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs
Discrete Applied Mathematics | 2024-01-09 | Paper |
Information sharing and coordination in a vaccine supply chain
Annals of Operations Research | 2023-11-16 | Paper |
Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
Naval Research Logistics | 2023-10-25 | Paper |
Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
Naval Research Logistics | 2023-10-18 | Paper |
Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
Naval Research Logistics | 2023-10-17 | Paper |
| Properly colored even cycles in edge-colored complete balanced bipartite graphs | 2023-10-07 | Paper |
| Sufficient conditions for $k$-factors and spanning trees of graphs | 2023-08-26 | Paper |
An alternative approach for proving the NP-hardness of optimization problems
European Journal of Operational Research | 2016-10-07 | Paper |
A note on reverse scheduling with maximum lateness objective
Journal of Scheduling | 2014-08-18 | Paper |
Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time
Naval Research Logistics | 2012-06-18 | Paper |
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
Discrete Applied Mathematics | 2012-05-30 | Paper |
Two-agent scheduling to minimize the total cost
European Journal of Operational Research | 2012-05-14 | Paper |
Batch scheduling of deteriorating products
Decision Making in Manufacturing and Services | 2011-06-28 | Paper |
Minimizing total completion time in a two-machine flow shop with deteriorating jobs
Applied Mathematics and Computation | 2006-11-15 | Paper |
Batch scheduling with controllable setup and processing times to minimize total completion time
The Journal of the Operational Research Society | 2005-06-21 | Paper |
Single machine batch scheduling with jointly compressible setup and processing times.
European Journal of Operational Research | 2004-01-05 | Paper |
