Scribd
Upload
67 views2 pages

Job Shop and Parallel Machine Scheduling Problems: Minimization of Makspan

This document discusses scheduling problems in flexible manufacturing systems (FMS). It introduces job shop and parallel machine scheduling problems, and the goal of minimizing makespan. It describes how FMS scheduling is a difficult combinatorial optimization problem, and different approaches that have been used to solve it, including heuristics for large complex problems. The paper presents a developed algorithm for solving the parallel machines job-shop problem and compares its results to other methods.

Uploaded by

Marya MEe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
67 views2 pages

Job Shop and Parallel Machine Scheduling Problems: Minimization of Makspan

This document discusses scheduling problems in flexible manufacturing systems (FMS). It introduces job shop and parallel machine scheduling problems, and the goal of minimizing makespan. It describes how FMS scheduling is a difficult combinatorial optimization problem, and different approaches that have been used to solve it, including heuristics for large complex problems. The paper presents a developed algorithm for solving the parallel machines job-shop problem and compares its results to other methods.

Uploaded by

Marya MEe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Job Shop and parallel machine scheduling

problems: minimization of Makspan


Introduction
Current production systems are growing in complexity. This complexity results from the demands of
the market, competition, quality as well as the density and diversity of the products they process. In
this type of problem, we are faced with a scheduling problem. The choice of the resolution method
strongly depends on the size and complexity of the problem. If the problem is large and of significant
complexity, it is not possible to provide an exact algorithm for such systems. We are naturally
interested in non-exact algorithms called 'heuristics' which present more interesting alternatives.
Among the problems that are often classified NP-Difficile, those of scheduling form a large part,
which justifies the use of the approximate methods for their resolution.
The system should be flexible, productive and should be able to meet the demands within
time bounds at a reasonable cost. An FMS can be considered flexible, if it is able to process parts
when they arrive into the system to changing the world as flexibility is the way to stay ahead in
business [habiba 2].
The FMS scheduling is among the hardest and interesting combinational optimization problem.
For this raison,researches used different approaches to solve this problem such as mathematical
programming, simulation, and heuristic algorithms… [5]. The choice of the resolution method of the
optimization problems depends strongly on the size and complexity on the problem. If the problem is
of small size and reduced complexity, an exact method can suffice and lead for an optimal solution.
For complex problems, the approached methods, in particular the heuristic ones present an interesting
alternative.(1111)
Aparallel machines job-shop problem is a generalisation of a job-shop problem to the case when there
are identical machines of the same type. Job-shop problems encountered in a flexible manufacturing
system, train timetabling, production planning and in other real-life scheduling systems. This paper
presents an develope algorithm for solving the parallel machines job-shop problem.

In a classical job shop problem, the elementary product operations follow a completely
ordered sequence according to the product to be manufactured. In some structures, each
elementary operation may be carried out on several machines, from where, thanks to the
versatility of the machines, a greater flexibility is obtained. We can talk about total flexibility if all the
machines are able to carry out all the operations, otherwise, it is a partial flexibility. This is what we
call the hybrid job shop or the flexible job shop. Multiprocessor Scheduling, Theory and
ApplicationsEdited by Eugene LevnerISBN 978-3-902613-02-8Hard cover, 436
pagesPublisher I-Tech Education and PublishingPublished online 01, December,
2007Frédéric Dugardin,

This work is part of solving the scheduling problems of flexible production systems.
We were particularly interested in those with routing flexibility.
This kind of flexibility that can be found in every system that includes identical, alternate or redundant
parallel machines offers several advantages in balancing machine loads better, allowing the system to
continue to operate and maintain its high performance despite occurrence of certain unexpected events
such as machine failures, ....
These properties are pushed many researchers to take into account during the implementation and
configuration of the systems, which explains the existence of many works that deal with scheduling
problems in manufacturing systems with presence of flexibility.
The idea of a better balancing of the loads on the machines of the job shop, pushed us to try it on a
system of parallel machines which contains a flexibility in the selection of the machines. For this we
developed an algorithm that was called MMIPMH to select the best makespan for a system of identical
parallel machines.
The results of this algorithm are compared to those of the LPT rule which is one of the methods that
gives the best results for the scheduling problem P || C max (the minimization of Cmax for the
problem of identical parallel machines without constraints ) which is an NP-complete problem.
These results confirmed that the MMIMPH method we developed almost always gives better results
than those given by the LPT rule and results in worst case worst case.
The power of this method is in the manner in which the load balancing is done on the different
machines of the system.
RESENTATION OF FLEXIBLE MANUFACTURING SYSTEM ENVIRONMENT
The FMS model studied is drawn from the literature (Saygin and Kilick, 1999; Hassam and Sari, 2010
[33]). It is composed from seven machines and two stations, one is a loading station and the other is an
unloading one. The system will process six kinds of parts. Each machine has an input and an output
queue. The loading station also has an input queue. Fig. (1) represents the model’s configuration, and
Table 1 shows possible alternative routings for each parts kind with the processing time for each
machine.

Fig. (1). Model FMS configuration. I: input buffer, O: output buffer.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy