Ppcp

FINAL PROJECT



Paper presented to the engineer Miguel Rojas
in the course of Planning, Scheduling and Production Control

Universidad del Norte
November 11th, 2011

“Scheduling aproduction of ceramic tiles”


Abstract
In manufacturing industry it is common to find different problems in production scheduling, due to the amount of machinery required for these processes. Formany years, an optimal solution to find the correct flow in the production has been sought, using a genetic algorithm. According to Ruiz and Maroto this requires:
“Provide a metaheuristic, in theform of a genetic algorithm, to a complex generalized flowshop scheduling problem that results from the addition of unrelated parallel machines at each stage, sequence dependent setup times and machineeligibility.”
Undoubtedly, the results achieved indicate that the use of this algorithm is effective and provides a better resolution to the problem.
Introduction
Currently, engineers strive forefficiency and effectiveness in any process that is done. It is necessary, in most cases, to use machines capable of running an entire production. To do this, efficiently and effectively it is necessaryto have a schedule, in order to optimize the use of machinery and to come up with the best results. The problems with the program on a production are known as "scheduling" and are solved with thehelp of different algorithms. It is said that: “Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling tominimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time.”
Description
The problem lies in scheduling a production of ceramic tiles; this manufacturingprocess is known as "quick and easy shooting" and is performed as follows: As a first step the clay powder is loaded into a mold and hydraulically pressed to form what is called the bisque. This...