Analysis of a Preference Order Assembly Line Problem

DOI10.1287/MNSC.27.9.1067MaRDI QIDQ3919433zbMATH OpenOpenAlexFDO

Authors Moshe Sniedovich

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

zbMATH Keywords

optimal solutionsoptimality conditionmonotonicity conditionpreference order assembly line problempreference order dynamic programming procedurestochastic assembly line balancing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Dynamic programming (90C39) Production models (90B30)

Cited in

(7)

• A versatile algorithm for assembly line balancing
• Multiobjective management of mining under water hazard by game theory
• A spreadsheet method for calculating work completion time probability distributions of paced or linked assembly lines
• Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm
• A classification of assembly line balancing problems
• A survey on problems and methods in generalized assembly line balancing
• Theory and applications of generalized dynamic programming: An overview

This page was built for publication: Analysis of a Preference Order Assembly Line Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3919433)