Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling

DOI10.1057/JORS.1996.23zbMATH Open0851.90053OpenAlexW1993786303MaRDI QIDQ4887785FDOQ4887785

Authors Andreas Drexl, Knut Haase 

Publication date 5 August 1996

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10419/155403

zbMATH Keywords

lot-sizingschedulinggreedy randomized algorithmproportional multi-item, capacitated, dynamic lot-sizing and scheduling problemregret-based biased sampling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Recommendations

• Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets
• Lotsizing and scheduling for production planning
• A Sequential Lot Sizing Heuristic with Optimal Average Performance
• Proportional lot sizing and scheduling: Some extensions
• Dynamic lot sizing with random demand and non-stationary costs

Cited in

(10)

• Simultaneous lotsizing and scheduling problems: a classification and review of models
• Distribution requirements and compactness constraints in school timetabling
• Metaheuristics: A bibliography
• Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
• Lot sizing and scheduling -- survey and extensions
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Capacitated lot-sizing with sequence dependent setup costs
• Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
• Um modelo de otimização para o problema integrado de dimensionamento de lotes e programação da produção em fábricas de refrigerantes
• Modeling industrial lot sizing problems: a review

This page was built for publication: Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling

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