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

DOI10.1057/JORS.1996.23zbMath0851.90053OpenAlexW1993786303MaRDI QIDQ4887785

Knut Haase, Andreas Drexl

Publication date: 5 August 1996

Published in: Unnamed Author (Search for Journal in Brave)

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

zbMATH Keywords

schedulinglot-sizinggreedy 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)

Related Items (10)

Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Capacitated lot-sizing with sequence dependent setup costs ⋮ Metaheuristics: A bibliography ⋮ Modeling industrial lot sizing problems: a review ⋮ Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and 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 ⋮ Lot sizing and scheduling -- survey and extensions ⋮ Distribution requirements and compactness constraints in school timetabling

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