Abstract
In this paper, the general time hierarchical planning and scheduling approach is introduced, which integrates both detailed scheduling and due date assignment for an online problem. In this approach, time is divided into intervals of increasing size, and the different sizes form a hierarchy. We show that for a simplified model, a multiple level bin packing approach is an approximation algorithm, and we further prove that under weak assumptions, the approximation quality is bounded independently of the depth of the hierarchy.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aghezzaf, E. H., Sitompul, C., & Van den Broecke, F. (2011). A robust hierarchical production planning for a capacitated two-stage production system. Computers & Industrial Engineering, 60(2), 361–372.
Behnamian, J., & Zandieh, M. (2010). Due windows group scheduling using an effective hybrid optimization approach. The International Journal of Advanced Manufacturing Technology, 46(5–8), 721–735.
Cheng, T., & Gupta, M. (1989). Survey of scheduling research involving due date determination decisions. European Journal of Operational Research, 38(2), 156–166.
Van den Heuvel, W., & Wagelmans, A. P. M. (2010). Worst-case analysis for a general class of online lot-sizing heuristics. Operations Research, 58(1), 59–67.
Kreipl, S., & Pinedo, M. (2004). Planning and scheduling in supply chains: An overview of issues in practice. Production and Operations Management, 13(1), 77–92.
Li, X., Gao, L., Zhang, C., & Shao, X. (2010). A review on integrated process planning and scheduling. International Journal of Manufacturing Research, 5(2), 161–180.
Li, Z., & Ierapetritou, M. G. (2010). Rolling horizon based planning and scheduling integration with production capacity consideration. Chemical Engineering Science, 65(22), 5887–5900.
Maravelias, C. T., & Sung, C. (2009). Integration of production planning and scheduling: Overview, challenges and opportunities. Computers & Chemical Engineering, 33(12), 1919–1930.
Meyr, H., & Mann, M. (2013). A decomposition approach for the general lotsizing and scheduling problem for parallel production lines. European Journal of Operational Research, 229(3), 718–731.
MISTA Proceedings (2013). In Kendall, G., Vanden Berghe, G., & McCollum, B. Proceedings of the Multidisciplinary International Scheduling Conference: Theory and Applications. MISTA, Ghent, ISSN 2305–249X.
Sahni, S. K. (1976). Algorithms for scheduling independent tasks. Journal of ACM, 23(1), 116–127.
Schneeweiss, C. (2003). Distributed decision making. Berlin, Heidelberg, New York: Springer.
Slotnick, S. A. (2011). Order acceptance and scheduling: A taxonomy and review. European Journal of Operational Research, 212(1), 1–11.
Váncza, J., Kis, T., & Kovács, A. (2004). Aggregation - the key to integrating production planning and scheduling. CIRP Annals - Manufacturing Technology, 53(1), 377–380.
Zorzini, M., Corti, D., & Pozzetti, A. (2008). Due date (dd) quotation and capacity planning in make-to-order companies: Results from an empirical analysis. International Journal of Production Economics, 112(2), 919–933.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Leoff, J., Ackermann, H. & Küfer, KH. Time-hierarchical scheduling. J Sched 19, 215–225 (2016). https://doi.org/10.1007/s10951-014-0384-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-014-0384-y