Skip to main content
SpringerLink
Log in

Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions

  • Original Paper
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper presents an integrated approach for short-term supply chain management (SCM) at a fast moving consumer goods production plant. The problem is to determine the production quantities, to provide a detailed production schedule, to trigger the relevant express deliveries of raw material, and to manage the distribution. We propose a linear integer model, which integrates all of these decisions within scheduling. To find high quality solutions in a reasonable amount of time, various solution methods are proposed, such as a greedy constructive heuristic, two tabu search metaheuristics, a basic variable neighborhood search and an enhanced one, which uses a variable shaking operator. Experiments on realistic instances show that the latter method is efficient and robust. This paper is a contribution to the SCM literature (indeed, only few references address the integration of short term decisions) and to the general metaheuristics field (as the variable neighborhood search paradigm is extended).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Allahverdi, A., Gupta, J. N., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27(2), 219–239.

    Article  Google Scholar 

  • Amrani, H., Martel, A., Zufferey, N., & Makeeva, P. (2011). A variable neighborhood search heuristic for the design of multicommodity production–distribution networks with alternative facility configurations. OR Spectrum, 33(4), 989–1007.

    Article  Google Scholar 

  • Azoury, K. S., & Miyaoka, J. (2013). Managing production and distribution for supply chains in the processed food industry. Production and Operations Management, 22(5), 1250–1268.

    Google Scholar 

  • Bard, J. F., & Nananukul, N. (2009). The integrated production–inventory–distribution–routing problem. Journal of Scheduling, 12(3), 257–280.

    Article  Google Scholar 

  • Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L. (1996). Multiprocessor scheduling with rejection. In: Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms (SODA’ 96). Philadelphia, USA.

  • Bierlaire, M., Thémans, M., & Zufferey, N. (2010). A heuristic for nonlinear global optimization. INFORMS Journal on Computing, 22(1), 59–70.

    Article  Google Scholar 

  • Bilgen, B., & Günther, H. O. (2010). Integrated production and distribution planning in the fast moving consumer goods industry: A block planning application. OR Spectrum, 32(4), 927–955.

    Article  Google Scholar 

  • Cao, Z., & Yang, X. (2009). A PTAS for parallel batch scheduling with rejection and dynamic job arrivals. Theoretical Computer Science, 410(27–29), 2732–2745.

    Article  Google Scholar 

  • Chen, Z. L. (2010). Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 58(1), 130–148.

    Article  Google Scholar 

  • Clark, A. R., & Clark, S. J. (2000). Rolling-horizon lot-sizing when set-up times are sequence-dependent. International Journal of Production Research, 38(10), 2287–2307.

    Article  Google Scholar 

  • Dastidar, S. G., & Nagi, R. (2005). Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs. Computers & Operations Research, 32(11), 2987–3005.

    Article  Google Scholar 

  • Dolgui, A., Eremeev, A. V., Kovalyov, M. Y., & Kuznetsov, P. M. (2010). Multi-product lot sizing and scheduling on unrelated parallel machines. IIE Transactions, 42(7), 514–524.

    Article  Google Scholar 

  • Dósa, G., & He, Y. (2006). Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines. Computing, 76, 149–164.

    Article  Google Scholar 

  • Ebben, M., Hans, E., & Olde Weghuis, F. (2005). Workload based order acceptance in job shop environments. OR Spectrum, 27, 107–122.

    Article  Google Scholar 

  • Gendreau, M., & Potvin, J.-Y. (Eds.). (2010). Handbook of Metaheuristics (2nd ed.). Berlin: Springer.

    Google Scholar 

  • Gerstl, E., & Mosheiov, G. (2012). Scheduling on parallel identical machines with job-rejection and position-dependent processing times. Information Processing Letters, 112(19), 743–747.

    Article  Google Scholar 

  • Hoogeveen, H., Skutella, M., & Woeginger, G. J. (2000). Preemptive scheduling with rejection. Lecture Notes in Computer Science, 1879, 268–277.

    Article  Google Scholar 

  • Jans, R., & Degraeve, Z. (2007). Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches. European Journal of Operational Research, 177(3), 1855–1875.

    Article  Google Scholar 

  • Józefowska, J., & Zimniak, A. (2008). Optimization tool for short-term production planning and scheduling. International Journal of Production Economics, 112(1), 109–120.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Lee, B. K., Kang, K. H., & Lee, Y. H. (2008). Decomposition heuristic to minimize total cost in a multi-level supply chain network. Computers & Industrial Engineering, 54(4), 945–959.

    Article  Google Scholar 

  • Li, C. L., & Ou, J. (2005). Machine scheduling with pickup and delivery. Naval Research Logistics, 52(7), 617–630.

    Article  Google Scholar 

  • Li, S., & Yuan, J. (2010). Parallel-machine scheduling with deteriorating jobs and rejection. Theoretical Computer Science, 411(40–42), 3642–3650.

    Article  Google Scholar 

  • Lu, L., Zhang, L., & Yuan, J. (2008). The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoretical Computer Science, 396, 283–289.

    Article  Google Scholar 

  • Lu, L., Cheng, T., Yuan, J., & Zhang, L. (2009). Bounded single-machine parallel-batch scheduling with release dates and rejection. Computers and Operations Research, 36, 2748–2751.

    Article  Google Scholar 

  • Melo, R. A., & Wolsey, L. A. (2010). Optimizing production and transportation in a commit-to-delivery business mode. European Journal of Operational Research, 203(3), 614–618.

    Article  Google Scholar 

  • Meyr, H. (2002). Simultaneous lotsizing and scheduling on parallel machines. European Journal of Operational Research, 139(2), 277–292.

    Article  Google Scholar 

  • Mladenovic, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24, 1097–1100.

    Article  Google Scholar 

  • Oğuz, C., Salman, S. F., & Yalçın, B. Z. (2010). Order acceptance and scheduling decisions in make-to-order systems. International Journal of Production Economics, 125(1), 200–211.

    Article  Google Scholar 

  • Seiden, S. S. (2001). Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science, 262, 437–458.

    Article  Google Scholar 

  • Shirvani, N., & Shadrokh, S. (2013). Coordination of a cyclic three-stage supply chain for fast moving consumer goods. Iranian Journal of Operations Research, 4(2), 175–190.

    Google Scholar 

  • Slotnick, S. A. (2011). Order acceptance and scheduling: A taxonomy and review. European Journal of Operational Research, 212(1), 1–11.

    Article  Google Scholar 

  • Stadtler, H. (2005). Supply chain management and advanced planning—basics, overview and challenges. European Journal of Operational Research, 163(3), 575–588.

    Article  Google Scholar 

  • Stecke, K. E., & Zhao, X. (2007). Production and transportation integration for a make-to-order manufacturing company with a commit-to-delivery business mode. Manufacturing & Service Operations Management, 9(2), 206–224.

    Article  Google Scholar 

  • Thevenin, S., Zufferey, N. (2014). Variable neighborhood search for a scheduling problem with time window penalties. In: Proceedings of the 14th international workshop on project management and scheduling (PMS), Munchen, Germany.

  • ten Kate, H. A. (1994). Towards a better understanding of order acceptance. International Journal of Production Economics, 37(1), 139–152.

    Article  Google Scholar 

  • Wang, H., & Lee, C. Y. (2005). Production and transport logistics scheduling with two transport mode choices. Naval Research Logistics, 52(8), 796–809.

    Article  Google Scholar 

  • Wang, X., & Cheng, T. (2009). Production scheduling with supply and delivery considerations to minimize the makespan. European Journal of Operational Research, 194(3), 743–752.

    Article  Google Scholar 

  • Zhong, W., Chen, Z. L., & Chen, M. (2010). Integrated production and distribution scheduling with committed delivery dates. Operations Research Letters, 38(2), 133–138.

    Article  Google Scholar 

  • Zhu, X., & Wilhelm, W. E. (2006). Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE transactions, 38(11), 987–1007.

    Article  Google Scholar 

  • Zufferey, N. (2012). Metaheuristics: Some principles for an efficient design. Computer Technology and Applications, 3, 446–462.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Geneva School of Economics and Management (GSEM), University of Geneva, Uni-Mail, Bd du Pont-d’Arve 40, 1211, Geneva 4, Switzerland

    Simon Thevenin & Nicolas Zufferey

  2. Laboratory for Production Management and Processes, Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland

    Rémy Glardon

Authors
  1. Simon Thevenin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolas Zufferey
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rémy Glardon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicolas Zufferey.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Thevenin, S., Zufferey, N. & Glardon, R. Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions. Ann Oper Res 259, 437–460 (2017). https://doi.org/10.1007/s10479-017-2498-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-017-2498-z

Keywords

Search

Navigation