Analysis of a Preference Order Assembly Line Problem
From MaRDI portal
Publication:3919433
DOI10.1287/mnsc.27.9.1067zbMath0466.90034OpenAlexW1973030063MaRDI QIDQ3919433
Publication date: 1981
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.27.9.1067
optimal solutionsmonotonicity conditionoptimality conditionpreference order assembly line problempreference order dynamic programming procedurestochastic assembly line balancing
Applications of mathematical programming (90C90) Production models (90B30) Dynamic programming (90C39)
Related Items (7)
A classification of assembly line balancing problems ⋮ A spreadsheet method for calculating work completion time probability distributions of paced or linked assembly lines ⋮ A versatile algorithm for assembly line balancing ⋮ Multiobjective management of mining under water hazard by game theory ⋮ Theory and applications of generalized dynamic programming: An overview ⋮ Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm ⋮ A survey on problems and methods in generalized assembly line balancing
This page was built for publication: Analysis of a Preference Order Assembly Line Problem
