Q5090421 (Q5090421): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ITCS.2019.44 / rank
Normal rank
 
Property / author
 
Property / author: Klaus Jansen / rank
Normal rank
 
Property / author
 
Property / author: Klaus Jansen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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: A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-sizing scheduling with batch setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong LP formulations for scheduling splittable jobs on unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting versus setup trade-offs for scheduling to minimize weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Integer Programs with Block Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / 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: \(n\)-fold integer programming in cubic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-preemptive scheduling with setup times: a PTAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling meets \(n\)-fold integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-preemptive Scheduling on Machines with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear discrete optimization. An algorithmic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split scheduling with uniform setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252357 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ITCS.2019.44 / rank
 
Normal rank

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7559087
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7559087

    Statements

    0 references
    0 references
    0 references
    0 references
    18 July 2022
    0 references
    parallel machines
    0 references
    setup time
    0 references
    EPTAS
    0 references
    \(n\)-fold integer programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers