abstract

• The objective of this model is to minimize the total

penalties of earliness and tardiness by deciding when to
start each order’s production and how to assign the
operations to machines (operators).
• A genetic optimization process is then presented
• to solve this model, in which a new chromosome
representation, a heuristic initialization process and
modified crossover and mutation operators are proposed.
• Three experiments using industrial data are illustrated to
evaluate the performance of the proposed method.
 Introduction
• The GA was first introduced by Holland (1975).
• GAs start with an initial population of chromosomes (also called
individuals) representing different possible solutions to a
problem.
• A chromosome consists of some genes. GAs work iteratively,
each single iteration is called a generation.
• At each generation, the fitness of each chromosome is
evaluated meaning that the GA is based on the mechanics of
natural selection theory of Darwin and based on survival of the
fittest principle which is derived from biological concept and
arena and also the decision is based on 5the value of fitness
function.
 cont.
• The chromosome is stochastically selected for the next
generation based on its fitness.
 JSS FOR APPAREL INDUSTRY

• Job shop scheduling (JSS) for apparel production is a flexible

multi-machine and multi-operation scheduling.
• At present, it is conducted by the shop-floor supervisor.
• Generally job shop scheduling performs or simplifies operation
management related problems to facilitate the working condition
in sewing shop floor of apparel industries.
 Job shop scheduling or the job-shop problem (JSP) is
an optimization problem in computer science  and operations
research(OR) in which jobs are assigned to resources at
particular times.
• The standard version of the problem is where you
have n jobs J1, J2, ..., Jn. Within each job there is a set of
operations O1, O2, ..., On which need to be processed in a specific
order (known as Precedence constraints)
 MODELING
• Model developing is performed based on genetic algorithm which
is derived from biological concept of natural selection and
genetic engineering. (www.wikepedia/Geenetic algorithm.com)
• The models on this paper are developed on the basis of
progressive bundle system(PBS) and unit production(UPS)
systems of apparel manufacturing technologies.
• The basic difference between PBS and UPS is progressive
bundle system have no hanger system at all and utilizes both
unskilled and skilled operators but unit production system
utilizes much skilled operators and have hanger system to
transfer bundles from one working are to the other in adverse
PBS have no hanger system but the bundles transfer by trolleys.
 cont.…
• During modelling the researchers utilized assumption
methodology before to be more approachable to the specified
problem.
 The assumptions are
 Once an operation is started, it cannot be interrupted.
 There is no shortage of materials, machine breakdown and
absence of operators in the job shop
 The job shop used for modelling is empty initially, in other
words, there is no WIP in each workstation.
 Cont.
 Constraints development and nomneculation;-
 Arrival time constraints The arrival time constraints state that
order Pi cannot be started until the arrival of order
 Allocation constraints Operation Oil can only be operated on
machines which can handle
• Each machine must process at least one operation
• Operation precedence constraints; The operation precedence
constraints state that an operation cannot be started before its
preceding operation is completed and it is transported to the
corresponding machine
 Processing time requirements; Operation Oil must be assigned
with processing time and setup time
 Cont.
• Objective function
• The objective of the developed algorithm is to reduce amount of
earliness and tardiness of time to deliver a specified given
production order
• For each order Pi, the due date Di is pre-determined by the
customer
• If the order (Pi) is accomplished later than the due date (Di),
penalty (ai) for each time unit of the delay is required.
• If the order is accomplished before the due date, it is not
accepted by the customer until the deadline.
• Thus, the manufacturing plant is compelled to store the order
until the due date and to spend penalty bi per time unite of
storage.
 cont.
 The objective FUNCTION mathematically looks like

 where the symbols respectively

• starting time of order Pi
• weight of tardiness penalty for order Pi
• tardiness of order Pi
• states if tardiness (Tdi) of order Pi is greater than 0
• weight of earliness penalty for order Pi
• earliness of order Pi
• GA(genetic algorithm) works iteratively its basis is iteration
sequentially to get better inherited off springs until the
termination point.
• each single iteration is called a generation
• At each generation, the fitness of each chromosome is
evaluated.
• The decision is based on fitness function, and the chromosome is
stochastically selected for the next generation based on its
fitness.
• New chromosomes, called offspring (also called children), are
produced by two genetic operators, crossover and mutation.
• The offspring are supposed to inherit the excellent genes from
their parents, so that the average quality of solutions is better
than that in the previous generations.
 Representation
• The first step in constructing the GA is to define an appropriate genetic
representation (coding).
 Many representations for the JSS problem have been developed (Cheng et
al., 1996), for example
• job-based representation
• operation-based representation and
• machine-based representation, etc.
 In this study, a novel chromosome representation is developed.
 Each chromosome =sequence of gene
 Gene=
• figural

Gene represents
Each chromosome is
machines and the
a sequence of genes
value of the gene
whose length is equal
represents operation
to the number of
number where the
machines to which
corresponding
operations can be
machine goes to
assigned
operate (process)