Heuristics and exact algorithms for solving the Monden problem
From MaRDI portal
Publication:1266568
DOI10.1016/0377-2217(94)00165-0zbMath0913.90159OpenAlexW2037777264MaRDI QIDQ1266568
Joaquín Bautista, Ramon Companys, Albert Corominas
Publication date: 7 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00165-0
Related Items (34)
Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets ⋮ The multi-objective assembly line worker integration and balancing problem of type-2 ⋮ A decomposition approach for the car resequencing problem with selectivity banks ⋮ Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm ⋮ An assessment of the effect of mass customization on suppliers' inventory levels in a JIT supply chain ⋮ Modelling and solving the production rate variation problem (PRVP) ⋮ Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling ⋮ Procedures for the time and space constrained assembly line balancing problem ⋮ Output Rate Variation Problem: Some Heuristic Paradigms and Dynamic Programming ⋮ Human factor policy testing in the sequencing of manual mixed model assembly lines. ⋮ Level schedules for mixed-model JIT production lines: characteristics of the largest instances that can be solved optimally ⋮ 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 ⋮ A beam search approach for the optimization version of the car sequencing problem ⋮ Optimal production sequencing problem to minimise line stoppage time in a mixed-model assembly line ⋮ A dynamic programming based heuristic for the assembly line balancing problem ⋮ Models for MMSP-W considering workstation dependencies: a case study of Nissan's Barcelona plant ⋮ On bills of materials structure and optimum product-level smoothing of parts usage in JIT assembly systems ⋮ Level scheduling under limited resequencing flexibility ⋮ Solving symmetric mixed-model multi-level just-in-time scheduling problems ⋮ Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules ⋮ Level scheduling for batched JIT supply ⋮ Scheduling inbound and outbound trucks at cross docking terminals ⋮ Sequence-to-customer goal with stochastic demands for a mixed-model assembly line ⋮ Mixed-model assembly line sequencing using beam search ⋮ Sequencing mixed-model assembly lines to minimize part inventory cost ⋮ Truck scheduling at zero-inventory cross docking terminals ⋮ 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 ⋮ Level scheduling of mixed-model assembly lines under storage constraints ⋮ Note on cyclic sequences in the product rate variation problem ⋮ Properties of a sequencing problem for a mixed model assembly line with conveyor stoppages ⋮ 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
Cites Work
- Minimizing variation of production rates in just-in-time systems: A survey
- A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
- Note—Sequencing JIT Mixed-Model Assembly Lines
- Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
- Note—An Improved Discrete Dynamic Programming Algorithm for Allocating Resources Among Interdependent Projects
- Branch-and-Bound Strategies for Dynamic Programming
- A hybrid approach to discrete mathematical programming
This page was built for publication: Heuristics and exact algorithms for solving the Monden problem
