The maximum deviation just-in-time scheduling problem. (Q1421459): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Nadia Brauner / rank
Normal rank
 
Property / author
 
Property / author: Q922272 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Messoud A. Efendiev / rank
Normal rank
 
Property / author
 
Property / author: Nadia Brauner / rank
 
Normal rank
Property / author
 
Property / author: Yves Cramer / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Messoud A. Efendiev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced sequences and optimal routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple approach to the product rate variation problem via axiomatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quota Method of Apportionment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Relation between the Product Rate Variation (PRV) Problem and the Apportionment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 0(n log n) algorithm for the convex bipartite matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Sequencing JIT Mixed-Model Assembly Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Analysis Of Balanced Jit Optimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing variation of production rates in just-in-time systems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic just-in-time sequences are optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal level schedules for mixed-model, multi-level just-in-time assembly systems / 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: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach for Sequencing Groups of Identical Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level Schedules for Mixed-Model, Just-in-Time Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complementary triples of Sturmian bisequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fraenkel's conjecture for six sequences / rank
 
Normal rank

Latest revision as of 13:18, 6 June 2024

scientific article
Language Label Description Also known as
English
The maximum deviation just-in-time scheduling problem.
scientific article

    Statements

    The maximum deviation just-in-time scheduling problem. (English)
    0 references
    26 January 2004
    0 references
    The authors revisited one of the most basic scheduling models of just-in-time production systems. Despite its apparent simplicity, this model is not completely understood, yet. In particular, its computational complexity is not exactly known. They show that the model is in co-NP and it is polynomially solvable when the number of part-types is fixed, but its general version may still turn out to be either co-NP-complete or polynomially solvable. Finally, obtaining a full description of instances with small max-deviation the authors present an interesting challenge for future research.
    0 references
    Scheduling
    0 references
    Sequencing
    0 references
    Just-in-time
    0 references
    High multiplicity
    0 references
    Convex graphs
    0 references
    Balanced words
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers