Please use this identifier to cite or link to this item:
Title: Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant
Authors: Duarte, Belmiro P. M. 
Santos, Lino O. 
Mariano, Jorge S. 
Keywords: Scheduling; Resource task network; Mixed-integer linear programming; Ceramic industry
Issue Date: 29-Aug-2008
Citation: Computers & Operations Research. In Press, Corrected Proof:
Abstract: This paper addresses the optimal design of the grinding section of a ceramic tile plant operating in a cyclic mode with the units (mills) following a batch sequence. The optimal design problem of this single product plant is formulated with a fixed time horizon of one week, corresponding to one cycle of production, and using a discrete-time resource task network (RTN) process representation. The size of the individual units is restricted to discrete values, and the plant operates with a set of limited resources (workforce and equipment). The goal is to determine the optimal number and size of the mills to install in the grinding section, the corresponding production schedule, and shift policy. This problem involves labor/semi-labor intensive (LI/SLI) units with a depreciation cost of the same order as that of the operation cost. The optimal design of the grinding section comprises the trade-off between these two costs. The resulting optimization formulation is of the form of a mixed integer linear programming (MILP) problem, solved using a branch and bound solver (CPLEX 9.0.2). The optimal solution is analyzed for various ceramic tile productions and different shift policies.Scope and Purpose
DOI: 10.1016/j.cor.2008.05.007
Rights: openAccess
Appears in Collections:FCTUC Eng.Química - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
filebb0362f6a4d44782aaf8d36ccf0a39b8.pdf387.48 kBAdobe PDFView/Open
Show full item record


checked on Jan 2, 2022

Page view(s)

checked on Dec 22, 2021


checked on Dec 22, 2021

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.