A mathematical model for selecting mixed models with due dates
From MaRDI portal
Publication:4460043
DOI10.1080/00207540210163892zbMath1038.90026OpenAlexW1999150844MaRDI QIDQ4460043
Publication date: 18 May 2004
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540210163892
Related Items
A scatter search based hyper-heuristic for sequencing a mixed-model assembly line, Solving the car sequencing problem via branch \& bound, Models for MMSP-W considering workstation dependencies: a case study of Nissan's Barcelona plant, Complexity indices for the multidimensional knapsack problem, Sequencing mixed-model assembly lines: survey, classification and model critique
Cites Work
- Unnamed Item
- Unnamed Item
- A genetic algorithm for the multidimensional knapsack problem
- The mixed and multi model line balancing problem: A comparison
- Algorithms for real-time scheduling of jobs on mixed model assembly lines
- A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines.
- Algorithms for mixed-model sequencing with due date restrictions
- Pattern based vocabulary building for effectively sequencing mixed-model assembly lines
- Sequencing jobs on an automobile assembly line: objectives and procedures
- Mixed-Model Sequencing to Minimize Utility Work and the Risk of Conveyor Stoppage
- Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems