The maximum deviation just-in-time scheduling problem.

DOI10.1016/S0166-218X(03)00222-1zbMath1042.90015MaRDI QIDQ1421459

Yves Cramer, Nadia Brauner

Publication date: 26 January 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

SchedulingSequencingJust-in-timeConvex graphsBalanced wordsHigh multiplicity

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (16)

Matrix approximation and Tusnády's problem ⋮ Integer matrices with constraints on leading partial row and column sums ⋮ Simultaneous optimization of classical objectives in JIT scheduling ⋮ Solution of the Liu-Layland problem via bottleneck just-in-time sequencing ⋮ Fleet and charging infrastructure decisions for fast-charging city electric bus service ⋮ Multidimensional continued fractions and symbolic codings of toral translations ⋮ Balancedness and coboundaries in symbolic systems ⋮ Just-in-Time Scheduling in Modern Mass Production Environment ⋮ Unnamed Item ⋮ Production smoothing in just-in-time manufacturing systems: a review of the models and solution approaches ⋮ Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture ⋮ Level scheduling under limited resequencing flexibility ⋮ Multiplicity and complexity issues in contemporary production scheduling ⋮ Sequencing mixed-model assembly lines to minimize part inventory cost ⋮ A framework for the complexity of high-multiplicity scheduling problems ⋮ Unbiased Matrix Rounding

Cites Work

• Unnamed Item
• Unnamed Item
• An 0(n log n) algorithm for the convex bipartite matching problem
• A linear-time algorithm for a special case of disjoint set union
• Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
• A simple approach to the product rate variation problem via axiomatics
• Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging
• Geometric algorithms and combinatorial optimization.
• Optimal level schedules for mixed-model, multi-level just-in-time assembly systems
• Cyclic just-in-time sequences are optimal
• Fraenkel's conjecture for six sequences
• On complementary triples of Sturmian bisequences
• Minimizing variation of production rates in just-in-time systems: A survey
• A framework for the complexity of high-multiplicity scheduling problems
• Integer Programming with a Fixed Number of Variables
• A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
• Note—Sequencing JIT Mixed-Model Assembly Lines
• Balanced sequences and optimal routing
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• The Quota Method of Apportionment
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Maximum matching in a convex bipartite graph
• A Note on the Relation between the Product Rate Variation (PRV) Problem and the Apportionment Problem
• A Computational Analysis Of Balanced Jit Optimization Algorithms

This page was built for publication: The maximum deviation just-in-time scheduling problem.