Flexible job shop scheduling problem with sequence dependent setup time and job splitting: Hospital catering case study

12Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

Abstract

This paper aims to study a real case of an optimization problem derived from a hospital supply chain. The present work focuses on developing operational decision support models and algorithms for production process scheduling in hospital catering. The addressed production system is considered as a flexible job shop system. The objective is to minimize the total flow time. A novel mathematical model and two metaheuristics for the production scheduling of multi-product and multi-stage food processes are developed. These methods have proven their effectiveness for the scheduling of operations of the food production processes and allowed significant improvements in the performance of the studied production system.

Cite

CITATION STYLE

APA

Abderrabi, F., Godichaud, M., Yalaoui, A., Yalaoui, F., Amodeo, L., Qerimi, A., & Thivet, E. (2021). Flexible job shop scheduling problem with sequence dependent setup time and job splitting: Hospital catering case study. Applied Sciences (Switzerland), 11(4), 1–27. https://doi.org/10.3390/app11041504

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free