Computational complexity and algorithms for two scheduling problems under linear constraints
From MaRDI portal
Publication:6495885
DOI10.1007/S10878-024-01122-0MaRDI QIDQ6495885
Publication date: 2 May 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling under linear constraints
- On the hardness of approximating minimum vertex cover
- Approximability of flow shop scheduling
- Bin packing under linear constraints
- Knapsack with variable weights satisfying linear constraints
- On solving linear programs with the ordered weighted averaging objective.
- Two-machine flow shop scheduling problem under linear constraints
- Linear and nonlinear programming
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Optimal two- and three-stage production schedules with setup times included
- The Design of Approximation Algorithms
- On Solving Optimization Problems with Ordered Average Criteria and Constraints
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Complexity of Scheduling Shops with No Wait in Process
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling independent tasks to reduce mean finishing time
- Scheduling
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Some graph optimization problems with weights satisfying linear constraints
- Related machine scheduling with machine speeds satisfying linear constraints
- Some graph optimization problems with weights satisfying linear constraints
- Related machine scheduling with machine speeds satisfying linear constraints
This page was built for publication: Computational complexity and algorithms for two scheduling problems under linear constraints
