Minimizing variation of production rates in just-in-time systems: A survey
From MaRDI portal
Publication:2367376
DOI10.1016/0377-2217(93)90215-9zbMath0771.90051OpenAlexW2075062325MaRDI QIDQ2367376
Publication date: 30 September 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90215-9
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
An iterated beam search algorithm for the multi-level production smoothing problem with workload smoothing goal, Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets, A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process, A comment on ``A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems, Minimising maximum response time, The multi-objective assembly line worker integration and balancing problem of type-2, Exact and meta-heuristic approaches for the production leveling 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, Algorithms for the car sequencing and the level scheduling problem, Response time variability, Modelling and solving the production rate variation problem (PRVP), An efficient implementation of a VNS heuristic for the weighted fair sequences problem, Integer programming models versus advanced planning business software for a multi-level mixed-model assembly line problem, On the part inventory model sequencing problem: complexity and beam search heuristic, A branch and bound algorithm for the response time variability problem, Output Rate Variation Problem: Some Heuristic Paradigms and Dynamic Programming, The maximum deviation just-in-time scheduling problem., Human factor policy testing in the sequencing of manual mixed model assembly lines., Unnamed Item, Production smoothing in just-in-time manufacturing systems: a review of the models and solution approaches, A heuristic procedure for the automobile assembly-line sequencing problem considering multiple product options, Improvement of earliness and lateness by postponement on an automotive production line, Solving the car sequencing problem via branch \& bound, Webster sequences, apportionment problems, and just-in-time sequencing, Optimal production sequencing problem to minimise line stoppage time in a mixed-model assembly line, On bills of materials structure and optimum product-level smoothing of parts usage in JIT assembly systems, Level scheduling under limited resequencing flexibility, Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems, Solving the response time variability problem by means of a psychoclonal approach, Level scheduling for batched JIT supply, Sequencing problem for a mixed-model assembly line in the Toyota production system, Sequence-to-customer goal with stochastic demands for a mixed-model assembly line, Analysis and solution to the single-level batch production smoothing problem, Scheduling just-in-time part supply for mixed-model assembly lines, Hyper-heuristic approaches for the response time variability problem, Advanced constraint propagation for the combined car sequencing and level scheduling problem, Mixed-model assembly line sequencing using beam search, 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, Heuristics and exact algorithms for solving the Monden 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, Solving the response time variability problem by means of a genetic algorithm, Mathematical programming modeling of the response time variability problem, Note on cyclic sequences in the product rate variation problem, Properties of a sequencing problem for a mixed model assembly line with conveyor stoppages, Parametric methods of apportionment, rounding and production, Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment 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, Interactive bicriterion decision support for a large scale industrial scheduling system, Decentralized reactive Kanban system, Multi-objective optimal scheduling of reconfigurable assembly line for cloud manufacturing
Cites Work
- Unnamed Item
- Unnamed Item
- A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
- Survey of scheduling research involving due date determination decisions
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Completion time variance minimization on a single machine is difficult
- Scheduling unit-time tasks with integer release times and deadlines
- Minimizing the average deviation of job completion times about a common due date
- A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
- Note—Sequencing JIT Mixed-Model Assembly Lines
- Developing production schedules which balance part usage and smooth production loads for just-in-time production systems
- Sequencing with Earliness and Tardiness Penalties: A Review
- Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Weakly admissible transformations for solving algebraic assignment and transportation problems
- Level Schedules for Mixed-Model, Just-in-Time Processes
- A parallel shortest augmenting path algorithm for the assignment problem
- Maximum matching in a convex bipartite graph
