Algoritmo Dispatching para la secuenciacin de operaciones en una

planta de fabricacin de Toallas

Vctor Quiroz Chacn, Julin Leonardo Mosquera Alba, Jess Chamorro

Paternina
Universidad de la Costa, Facultad de Ingeniera Industrial, Barranquilla,
Colombia
vquiroz1@cuc.edu.co
Universidad de la Costa, Facultad de Ingeniera Civil, Barranquilla, Colombia
Jchamorr1@cuc.edu.co
Universidad de la Costa, Facultad de Ingeniera Industrial, Barranquilla,
Colombia
Jmosquer6@cuc.edu.co
Abstract. This paper shows the application of one method of sequencing
operations carried out in a textile industry, with the objective of
minimizing the average delay in delivering your order or removes the
best. In principle, the nature of the problem according to the features
listed in producing various towels, this way is set it is determined whether
the method proposed resolution (Heuristics algorithm dispatching) is
appropriate and feasible for the situation plant. After this, the dispatching
algorithm is implemented in a software application where the resolution
procedure will be developed. Subsequently the results obtained with the
delivery schedule of the company, and the sequence given by the study
with the current model of sequencing operations in the company handled
compared. Finally the results achieved with the application of heuristics
are concluded by titration.
Keywords: Sequencing, Operations, Method, Algorithm, Dispatching,
Orders, Problem, Production, Resolution, Ground Computers, Procedure,
Heuristic, Enterprise Application Results.

1. Introduction
In industrial environments, it is common in the facility are carried out
various types of operations and schedules. The program provides a
basis for assigning tasks to the workplace. The workload technique used
to control the ability and highlight the excess or lack of work. Sequencing
is a series of parts (usually called tasks) must be manufactured with the
help of a number of machines. The manufacture itself involves subjecting
the part to a series of operations, each operation is assigned to a
particular machine and has a known duration. Sequencing methods must
comply with certain rules of priority: first-in first-out, processing time, date
of next delivery, longer processing time and critical reason. You should
set a time sequence of operations on each machine so that a certain
performance index in order to optimize.

2. Literature Review

Petri nets and genetic algorithms, a proposal for scheduling flexible

manufacturing systems.
This algorithm presents a new approach to production scheduling for
SFM that combines the advantages of PNs modeling with the ability of
GA to solve production scheduling problems in SMF. Thus it seeks to
determine the problem and hence study schedule production of a
number n of jobs in an SMF with the objective to minimize the total
weighted tardiness T also offers the advantage of allowing prioritize
urgent jobs on those who are not as critical, penalizing the objective
function, therefore the number of periods of extra time that you should
use for each job completion after established deadline, as priority factor
assigned to the job.

Minimizing the delay for the flexible flow shop setup using
constructive heuristics and a genetic algorithm
The flexible scheduling problem is to resolve flow shop scheduling jobs n
sequential system of m stages, which may be one or more machines in
parallel. The sequence of the work process begins in stage one and ends
at step m.

Production scheduling in parallel machines with lots of transfer: a

case study.
In this paper a method of production scheduling to solve a real case
assignment and sequencing of operations of a plant in the automotive
sector, which is required to minimize the average delivery delay is
presented to the client. The problem has been identified as a case of
machine shop with parallel machines and the average delay as the

objective function. The procedure is designed dispatching algorithm

implemented by computer, in which raised two alternative embodiments:
first, a direct method, which provides an initial deterministic solution, and
secondly, a randomized control that allows the user probabilistically
weighting the priority criteria, in order to try to improve the initial solution.
From the data of machines and blanks, the application provides the
manufacturing sequence of operations associated with the average
delay, the machines to be allocated and the start and end of
manufacture. To address possible reprogramming to be made to adapt
the program generated unexpected, we have tried the program is
introducing robust rules of robustness in the algorithm itself.

Sequencing operations of a company in the automotive sector in a

machine shop environment with parallel machines.
The problem is described, showing the initial situation of the plant,
explaining how the production scheduling is done at present, and
highlighting the problems that exist. In the subsequent theoretical
analysis identifies the problem as a case of mechanical workshop called
Flexible Job-Shop Scheduling Problem (FJSSP) and a state of the art
methods detailed resolution. The different alternatives are compared to
date and proposes a procedure for resolving a heuristic method based
on computer implementation of a dispatching algorithm.

Sequencing dynamic flexible manufacturing systems using

machine learning analysis of major existing systems sequencing
A common way to dynamically sequencing the jobs in manufacturing
systems is through the use of dispatching rules. However, the problem
with this method is that the behavior of the manufacturing system
depends on your state, and there is no rule that outperform others in all
possible states that can present the manufacturing system. Therefore, it
would be interesting to use whichever is the most suitable order. To
achieve this, one can utilize systems that employ machine learning
sequencing that allow analyzing the previous behavior of the
manufacturing system (training samples), obtain necessary to determine
the most appropriate sequencing rule at each instant knowledge. In this
paper a review of the main existing systems sequencing literature using
machine learning to dynamically vary the dispatching rule used at all
times is performed.

3. Methodology

It will be defined by the characteristics of the problem to be solved

(number of machines and operations for all types of towels, demand for
different towels, processing times, setup times, transferable batch
quantity, delivery dates and penalties, etc. )
Given the nature of the problem, a method is selected while not giving an
optimal solution, it approaches it, therefore, incurred the heuristic method
that yields a feasible solution in a computationally flextime.
It continues to state the nomenclature and method Dispatching
Dispatching The method starts from an initial solution and empty
elements are added according to certain criteria for the final solution.
Once programmed operation, it does not reconsider or modify in
following steps. Heumar {page 52}
It starts by choosing the machine to operate according to a set of priority
rules.
Since our goal is to minimize both the average delay of orders can be an
essential priority rule is to choose the machine more readily available, ie,
starting with the operation ASAP. In case of a tie, the machine selects
which operation is the primary, if a tie still exists here, you would use the
machine whose operating time is lowest for the core business, should
continue a tie, we choose then any of the machines that have been tied.
After the machine chosen, it has to select the corresponding operation.
To do this, you must follow a priority order that is routed back guarantee
and our objective function. Therefore, you should select those orders in
principle towels containing a greater number of days of backlog.
Following the same order of priority, then would select the towels next
delivery date, also, another priority is given by the towels in the process
longer and finally prioritizes towels are more average demand.
Selected operation, it passes elective chosen, then the sequence is
saved with its start and end time of operation k i towel. Thus the
sequence is updated. If this is not the last operation of a towel, the next
operation moves from other operations to selected operation and return
to continue the procedure
Machine associated with the following operation in cases where the
operation that follows continue on the same machine or a different pass
to be taken into account. For the latter case, it will be to transfer a given
batch of towels from one machine to another.
Finally the average delay as the division between the sum of the delays
for each of the washclothes and towels number of orders is calculated.