Computational complexity and algorithms for two scheduling problems under linear constraints (Q6495885): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-024-01122-0 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4833804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some graph optimization problems with weights satisfying linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling problem under linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some graph optimization problems with weights satisfying linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling under linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack with variable weights satisfying linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving linear programs with the ordered weighted averaging objective. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving Optimization Problems with Ordered Average Criteria and Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Shops with No Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing under linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ordered weighted averaging aggregation operators in multicriteria decisionmaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Related machine scheduling with machine speeds satisfying linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Related machine scheduling with machine speeds satisfying linear constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-024-01122-0 / rank
 
Normal rank

Latest revision as of 19:47, 30 December 2024

scientific article; zbMATH DE number 7841575
Language Label Description Also known as
English
Computational complexity and algorithms for two scheduling problems under linear constraints
scientific article; zbMATH DE number 7841575

    Statements

    Computational complexity and algorithms for two scheduling problems under linear constraints (English)
    0 references
    0 references
    0 references
    2 May 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers