Computational complexity and algorithms for two scheduling problems under linear constraints
From MaRDI portal
(Redirected from Publication:6495885)
Recommendations
- On the NP-hardness of two scheduling problems under linear constraints
- Scheduling under linear constraints
- Two-machine flow shop scheduling problem under linear constraints
- A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
- Parallel machine scheduling with machine availability and eligibility constraints
Cites work
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Approximability of flow shop scheduling
- Bin packing under linear constraints
- Complexity of Scheduling Shops with No Wait in Process
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 757675 (Why is no real title available?)
- Knapsack with variable weights satisfying linear constraints
- Linear and nonlinear programming
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- On solving linear programs with the ordered weighted averaging objective.
- On Solving Optimization Problems with Ordered Average Criteria and Constraints
- On the hardness of approximating minimum vertex cover
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Related machine scheduling with machine speeds satisfying linear constraints
- Related machine scheduling with machine speeds satisfying linear constraints
- Scheduling independent tasks to reduce mean finishing time
- Scheduling under linear constraints
- Scheduling. Theory, algorithms, and systems
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Some graph optimization problems with weights satisfying linear constraints
- Some graph optimization problems with weights satisfying linear constraints
- The Complexity of Flowshop and Jobshop Scheduling
- The design of approximation algorithms
- Two-machine flow shop scheduling problem under linear constraints
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
Cited in
(2)
This page was built for publication: Computational complexity and algorithms for two scheduling problems under linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495885)
