A heuristic procedure for the automobile assembly-line sequencing problem considering multiple product options
From MaRDI portal
Publication:3541179
DOI10.1080/00207540701381291zbMath1159.90367MaRDI QIDQ3541179
No author found.
Publication date: 25 November 2008
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540701381291
simulated annealing; assembly line sequencing; automobile production; sequencing considering multiple options
Cites Work
- A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
- Simulated annealing: A tool for operational research
- Heuristics and exact algorithms for solving the Monden problem
- Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
- A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines.
- 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
- Minimizing variation of production rates in just-in-time systems: A survey
- Solving real car sequencing problems with ant colony optimization
- Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints
- A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
- Note—Sequencing JIT Mixed-Model Assembly Lines
- Review and comparison of three methods for the solution of the car sequencing problem
- Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
- A comparative analysis of sequencing procedures for mixed-model assembly lines in a just-in-time production system
- Level Schedules for Mixed-Model, Just-in-Time Processes
