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

DOI10.1007/978-3-031-39344-0_5MaRDI QIDQ6535800FDOQ6535800

Authors: Kameng Nip 

Publication date: 28 February 2024

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

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)

Cites Work

• Title not available (Why is that?)
• Linear and nonlinear programming
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal two- and three-stage production schedules with set-up time included
• The Complexity of Flowshop and Jobshop Scheduling
• On solving linear programs with the ordered weighted averaging objective.
• Scheduling independent tasks to reduce mean finishing time
• Complexity of Scheduling Shops with No Wait in Process
• 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 under linear constraints
• Some graph optimization problems with weights satisfying linear constraints
• Some graph optimization problems with weights satisfying linear constraints
• Approximability of flow shop scheduling
• Scheduling meets \(n\)-fold integer programming
• Bin packing under linear constraints
• Two-machine flow shop scheduling problem under linear constraints
• Scheduling. Theory, algorithms, and systems
• Knapsack with variable weights satisfying linear constraints
• Related machine scheduling with machine speeds satisfying linear constraints
• Related machine scheduling with machine speeds satisfying 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)