Planning horizons for multi-item hierarchical production scheduling problems: A heuristic search procedure

DOI10.1016/0377-2217(88)90200-7zbMath0652.90055OpenAlexW2006692437MaRDI QIDQ1107425

In-Jazz Chen, George L. Y. Cheng, Chen-Hua Chung

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90200-7

zbMATH Keywords

aggregate planning problemheuristics. direct search proceduremaster production scheduling problemmulti-item hierarchical production planning process

Mathematics Subject Classification ID

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

Related Items (1)

Optimizing the workload of production units of a make-to-order manufacturing system

Cites Work

• Dynamic Version of the Economic Lot Size Model
• `` Direct Search Solution of Numerical and Statistical Problems
• Using Linear Programming to Derive Planning Horizons for a Production Smoothing Problem
• An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
• Planning Horizons for the Dynamic Lot Size Model with Backlogging
• Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
• Production Smoothing with Fluctuating Price
• Horizon Effects in Aggregate Production Planning with Seasonal Demand
• Planning Horizons for Production Smoothing with Deterministic Demands
• General Planning Horizons for Production Smoothing with Deterministic Demands
• An Analytic Framework for Evaluating Rolling Schedules
• Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model
• Optimal Production Scheduling and Employment Smoothing with Deterministic Demands
• Production Planning Over Time and the Nature of the Expectation and Planning Horizon

This page was built for publication: Planning horizons for multi-item hierarchical production scheduling problems: A heuristic search procedure