A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimizing Makespan in No-Wait Job Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of optimal schedules in preemptive shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the three-machine open shop with a bottleneck machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Open Shop Preemptive Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three, four, five, six, or the complexity of scheduling with communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge chromatic number of a directed/mixed multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to multi-parameter complexity analysis of discrete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of mixed shop scheduling problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank

Latest revision as of 08:32, 7 July 2024

scientific article
Language Label Description Also known as
English
A complete 4-parametric complexity classification of short shop scheduling problems
scientific article

    Statements

    A complete 4-parametric complexity classification of short shop scheduling problems (English)
    0 references
    5 February 2014
    0 references
    0 references
    shop scheduling
    0 references
    makespan minimization
    0 references
    complexity classification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references