On the NP-hardness of two scheduling problems under linear constraints

DOI10.1007/978-3-031-39344-0_5MaRDI QIDQ6535800zbMATH OpenFDO

Authors Kameng Nip

Publication date 28 February 2024

zbMATH Keywords

computational complexitylinear programmingscheduling

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Computational complexity and algorithms for two scheduling problems under linear constraints
• Scheduling under linear constraints
• A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
• Two-machine flow shop scheduling problem under linear constraints
• scientific article; zbMATH DE number 3891075

Cites work

• 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?)
• 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
• 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.
• Optimal two- and three-stage production schedules with set-up time included
• 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 meets n-fold integer programming
• 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
• Two-machine flow shop scheduling problem under linear constraints

Cited in

(2)

• A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
• Computational complexity and algorithms for two scheduling problems under linear constraints

This page was built for publication: On the NP-hardness of 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 Q6535800)