Level Schedules for Mixed-Model, Just-in-Time Processes
From MaRDI portal
Publication:4274633
DOI10.1287/mnsc.39.6.728zbMath0783.90047MaRDI QIDQ4274633
Publication date: 2 January 1994
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.39.6.728
manufacturing; graph-theoretic approach; matching in bipartite graphs; smooth schedules; nonconvex objective function; Just-in- Time
90B30: Production models
Related Items
Production smoothing in just-in-time manufacturing systems: a review of the models and solution approaches, Sequence-to-customer goal with stochastic demands for a mixed-model assembly line, Analysis and solution to the single-level batch production smoothing problem, Level scheduling under limited resequencing flexibility, Integer matrices with constraints on leading partial row and column sums, Using aggregation to reduce response time variability in cyclic fair sequences, Matrix approximation and Tusnády's problem, An assessment of the effect of mass customization on suppliers' inventory levels in a JIT supply chain, Simultaneous optimization of classical objectives in JIT scheduling, Solution of the Liu-Layland problem via bottleneck just-in-time sequencing, Algorithms for the car sequencing and the level scheduling problem, Response time variability, Solving the car sequencing problem via branch \& bound, Apportionment methods and the Liu-Layland problem, Level scheduling for batched JIT supply, Sequencing mixed-model assembly lines to minimize part inventory cost, Sequencing mixed-model assembly lines: survey, classification and model critique, The product rate variation problem and its relevance in real world mixed-model assembly lines, Mathematical programming modeling of the response time variability problem, A simple approach to the product rate variation problem via axiomatics, Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging, Parametric methods of apportionment, rounding and production, A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process, Modelling and solving the production rate variation problem (PRVP), The maximum deviation just-in-time scheduling problem., Note on cyclic sequences in the product rate variation problem, A transformed two-stage method for reducing the part-usage variation and a comparison of the product-level and part-level solutions in sequencing mixed-model assembly lines, A linear time algorithm for maximum matchings in convex, bipartite graphs, Minimizing variation of production rates in just-in-time systems: A survey, A Lagrangean relaxation approach for the mixed-model flow line sequencing problem, A recovering beam search algorithm for the single machine just-in-time scheduling problem, A multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines, A framework for the complexity of high-multiplicity scheduling problems, Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem, Unbiased Matrix Rounding, A heuristic procedure for the automobile assembly-line sequencing problem considering multiple product options, Evaluating sequences for paced, mixed-model assembly lines with JIT component fabrication
