Parameterized complexity of machine scheduling: 15 open problems (Q1782183): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q129470375, #quickstatements; #temporary_batch_1730844038273
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A survey of scheduling problems with setup times or costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine precedence constrained scheduling is a Vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The routing open-shop problem on a network: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimizing the weighted number of late jobs in unit execution time open-shops. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean flow time scheduling problems with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling and colorful independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completing Partial Schedules for Open Shop with Unit Processing Times and Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with forbidden start times / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for the complexity of high-multiplicity scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop problems with unit time operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit time open shops to minimize the weighted number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of polynomial time approximation schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4673408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean flow time with release time constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for weighted problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parametric complexity of schedules to minimize tardy tasks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-multiplicity scheduling on one machine with forbidden start and completion times / 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: Polynomiality for Bin Packing with a Constant Number of Item Types / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strip Graphs: Recognition and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: About the Structure of the Integer Cone and its Application to Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural parameters for scheduling with assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan Minimization in Job Shops: A Linear Time Approximation Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Races in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete 4-parametric complexity classification of short shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of minimizing the number of late jobs in unit time open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine problems with equal processing times: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to: ``Minimizing total tardiness on parallel machines with preemptions'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable assignment with couples: parameterized complexity and local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and fixed-parameter tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for scheduling tasks with discrete starting times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation algorithms for machine scheduling: Ten open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in open shops: A polynomial time approximation scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Problems in Throughput Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing weighted number of just-in-time jobs on unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is a unit-job shop not easier than identical parallel machines? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129470375 / rank
 
Normal rank

Latest revision as of 23:01, 5 November 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of machine scheduling: 15 open problems
scientific article

    Statements

    Parameterized complexity of machine scheduling: 15 open problems (English)
    0 references
    0 references
    0 references
    18 September 2018
    0 references
    parallel machines
    0 references
    shop scheduling
    0 references
    makespan
    0 references
    total completion time
    0 references
    total tardiness
    0 references
    throughput
    0 references
    number of tardy jobs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references