You are here

A hybrid flow shop model for an ice cream production scheduling problem

Journal Name:

Publication Year:

DOI: 
doi:10.3926/jiem.2009.v2n1.p60-89
Abstract (2. Language): 
Abstract: In this paper we address the scheduling problem that comes from an ice cream manufacturing company. This production system can be modelled as a three stage nowait hybrid flow shop with batch dependent setup costs. To contribute reducing the gap between theory and practice we have considered the real constraints and the criteria used by planners. The problem considered has been formulated as a mixed integer programming. Further, two competitive heuristic procedures have been developed and one of them will be proposed to schedule in the ice cream factory.
60-89

REFERENCES

References: 

Bertel, S., & Billaut, J. (2004). A genetic algorithm for an industrial multiprocessor
flow shop scheduling problem with recirculation. European Journal of Operational
Research, 159(3), 651-662.
Garcia, J. M., & Lozano, S. (2005). Production and delivery scheduling problem with
time windows. Computers & Industrial Engineering, 48, 733-742.
Göthe-Lundgren, M., T. Lundgren, J., & A. Persson, J. (2002). An optimization
model for refinery production scheduling. International Journal of Production
Economics, 78(3), 255-270.
Guinet, A. G. P., & Solomon, M. M. (1996). Scheduling hybrid flowshops to
minimize maximum tardiness or maximum completion time. International Journal
of Production Research, 34(6), 1643-1654.
Guirchoun, S., Martineau, P., & Billaut, J. -. (2005). Total completion time
minimization in a computer system with a server and two parallel processors.
Computers & Operations Research, 32(3), 599-611.
doi:10.3926/jiem.2009.v2n1.p60-89 ©© JIEM, 2009 – 2(1): 60-89 – ISSN: 2013-0953
A hybrid flow shop model for an ice cream production scheduling problem 88
I. Ribas Vila; R. Companys Pascual
Harjunkoski, I., & Grossmann, I. E. (2002). Decomposition techniques for
multistage scheduling problems using mixed-integer and constraint programming
methods. Computers & Chemical Engineering, 26(11), 1533-1552.
Jin, Z. H., Ohno, K., Ito, T., & Elmaghraby, S. E. (2002). Scheduling hybrid
flowshops in printed circuit board assembly lines. Production and Operations
Management, 11(2), 216-230.
Lee, G. C., Kim, Y. D., & Choi, S. W. (2004). Bottleneck-focused scheduling for a
hybrid flowshop. International Journal of Production Research, 42(1), 165-181.
Lin, H. T., & Liao, C. J. (2003). A case study in a two-stage hybrid flow shop with
setup time and dedicated machines. International Journal of Production
Economics, 86(2), 133-143.
Maravelias, C. T., & Grossmann, I. E. (2003). New general continuous-time
State−Task network formulation for short-term scheduling of multipurpose batch
plants. Industrial & Engineering Chemistry Research, 42(13), 3056-3074.
Narastmhan, S. L., & Panwalkar, S. S. (1984). Scheduling in a two-stage
manufacturing process. International Journal of Production Research, 22(4), 555-
564.
Paul, R. J. (1979). A production scheduling problem in the glass-container industry.
Operations Research, 27(2), 290-302.
Proust, C., & Grunenberguer, E. (1995). Planification de production dans un
contexte de flow-shop hybride à deux étages: Conception et interprogrammation
d'ARIANNE 2000. RAPA, 8(5), 715-734.
Ribas, I. (2007). Programación multicriterio de un sistema productivo con flujo
regular sin esperas y estaciones en paralelo. aplicación a una fábrica de helados.
Universistat Politècnica de Valencia.
Ruiz, R., & Maroto, C. (2006). A genetic algorithm for hybrid flowshops with
sequence dependent setup times and machine eligibility. European Journal of
Operational Research, 169(3), 781-800.

Thank you for copying data from http://www.arastirmax.com