Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times in Frozen Food Industry

Article Preview

Abstract:

In this paper, a scheduling problem in the freezing station of a frozen food industry is addressed. It is a case of the unrelated parallel machines with machine-dependent and job sequence-dependent setup times problem. In a production shift, each freezing machine is allowed to process only products in the same product family. A mathematical model is developed to solve the problem in order to minimize the production related cost including production cost, fixed production cost, setup cost, inventory holding cost, and backlog cost. The proposed model is tested with a set of various problems. The results demonstrate that the proposed mathematical model could optimally solve the small sized problems.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

475-478

Citation:

Online since:

August 2015

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] K.C. Ying, H.M. Cheng, Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic, Expert Systems with Applications, 37 (2010) 2848-2852.

DOI: 10.1016/j.eswa.2009.09.006

Google Scholar

[2] T.C.E. Chen, C.C.S. Sin, A state-of-the-art review of parallel-machine scheduling research, " European Journal of Operational Research, 47 (1990) 271-292.

DOI: 10.1016/0377-2217(90)90215-w

Google Scholar

[3] P.L. Rocha, M.G. Ravetti, G.R. Mateus, P.M. Pardalos, Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times, Computers & Operations Research, 35 (2008) 1250-1264.

DOI: 10.1016/j.cor.2006.07.015

Google Scholar

[4] H. Meyr, Simultaneous lotsizing and scheduling on parallel machines, European Journal of Operational Research, 139 (2002), 277-292.

DOI: 10.1016/s0377-2217(01)00373-3

Google Scholar

[5] H. Meyr, M. Mann, A decomposition approach for the general lotsizing and scheduling problem for parallel production lines, European Journal of Operational Research, 229 (2013), 718-731.

DOI: 10.1016/j.ejor.2013.03.036

Google Scholar

[6] F. Seeanner, B. Almada-Lobo, H. Meyr, Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems, Computers & Operations Research, 40 (2013).

DOI: 10.1016/j.cor.2012.07.002

Google Scholar