On the NP-hardness of two scheduling problems under linear constraints
From MaRDI portal
Publication:6535800
DOI10.1007/978-3-031-39344-0_5MaRDI QIDQ6535800
Publication date: 28 February 2024
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling under linear constraints
- 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
- Scheduling meets \(n\)-fold integer programming
- Linear and nonlinear programming
- Optimal two- and three-stage production schedules with setup times included
- 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
- Scheduling independent tasks to reduce mean finishing time
- 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
- Scheduling
- 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: On the NP-hardness of two scheduling problems under linear constraints
