Scheduling and controlling Work-In-Process: An On-line Study for Shop Problems

In this paper, we address the problem of production systems having two characteristics. First, the manufacturing times can be chosen between g iven bounds. Such a production system is said to have controllable processing times. Second, an operation
of 16
All materials on our website are shared by users. If you have any questions about copyright issues, please report us to resolve them. We are always happy to assist you.
  Scheduling and Controlling Work-in-Process : An onLine Study for Shop Problems Fabrice Chauvet, Jean-Marie Proth To cite this version: Fabrice Chauvet, Jean-Marie Proth. Scheduling and Controlling Work-in-Process : An on LineStudy for Shop Problems. [Research Report] RR-3950, 2000, pp.15.  < inria-00072699 > HAL Id: inria-00072699 Submitted on 24 May 2006 HAL  is a multi-disciplinary open accessarchive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come fromteaching and research institutions in France orabroad, or from public or private research centers.L’archive ouverte pluridisciplinaire  HAL , estdestin´ee au d´epˆot et `a la diffusion de documentsscientifiques de niveau recherche, publi´es ou non,´emanant des ´etablissements d’enseignement et derecherche fran¸cais ou ´etrangers, des laboratoirespublics ou priv´es.  1INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Scheduling and Controlling Work-In-Process :An On-line Study for Shop Problems Fabrice Chauvet - Jean-Marie Proth N ° 3950Mai 2000 ___________ THEME 4 ____________  2 Ordonnancement et Contrle des En-cours :Une Etude des Problèmes d'Atelier. Fabrice CHAUVETBOUYGUES TELECOM R&DEuropa, 30 avenue dl’Europe, 78944 Vlizy Cedex, France Jean-Marie PROTHINRIA4 rue Marconi, 57070 Metz Technople, France Résumé Dans ce papier, nous nous intressons aux systèmes de production qui ont deuxcaractristiques : les temps opratoires peuvent être choisis entre deux limites donnes, etune opration doit dbuter dès que l'opration prcdente (s'il en existe une) se termine(problème sans atttente). Plusieurs algorithmes en ligne sont proposs pouminimiser les temps de fin defabrication dans les systèmes en ligne (flow shops) et les ateliers (jobs shops). Nousdmontrons que, dans le pire des cas, l'ordonnancement obtenu avec ces algorithmes dure mfois plus que l'ordonnancement optimal, m tant le nombre de machines. Nous donnonsplusieurs autres rsultats des ratios qui valuent la comptitivit du système. Mots clés Ordonnancement en ligne, problèmes sanattente, problèmes à temps contrlables.  3 Scheduling and controlling Work-In-Process:An On-line Study for Shop Problems Fabrice CHAUVETBOUYGUES TELECOM R&DEuropa, 30 avenue dl’Europe, 78944 Vélizy Cedex, France Jean-Marie PROTHINRIA4 rue Marconi, 57070 Metz Technopôle, France Abstract In this paper, we address the problem of production systems having two characteristics. First,the manufacturing times can be chosen between given bounds. Such a production system issaid to have controllable processing times. Second, an operation must start as soon as theprevious operation on the same part (if any) is completed. A production system having thischaracteristic is said to be no-wait.Several on-line schedules are considered to minimize the makespan in flow shop and jobshop situations. We prove that in the worst case, the makespan provided by these schedulesis m  times longer than the optimal one (for different flow shops and job shops), m  being thenumber of machines. We give several related results on competitive ratio. Keywords On-line scheduling, no-wait problems, controllable processing times.  4 1.   Introduction In this paper, we study an approach that aims at scheduling parts and controlling WIP. Hence, ware interested in the two following characteristics:First, the processing time P k   ,j  of an operation k   of job  j  can be selected in a given time interval[ l k   ,j ; u k   ,j ], with 0 < l k   ,j < +• and l k   ,j • u k   ,j • +•. The processing times are said to b controllable :processing times are decision variables.Second, an operation starts as soon as the previous operation on the part (if any) ends: the systeconsidered in this paper is of no-wait   type.These two characteristics are apparently restrictive. In fact, they are of utmost importance tocontrol many industrial systems, as showed hereafter.  Figure 1-  The duration l k   ,j  is uncompressible while the rest of the processing time ( u k   ,j  - l k   ,j ) is not.A number of papers [5,6] have dealt with the no-wait scheduling problems  (processing times beingfixed, i.e. l k   ,j = u k   ,j ). A no-wait situation occurs either because of a lack of intermediate storagcapacity, or because of the processing technology itself. For instance, no-wait systems exist in the hotmetal rolling industry, since any interruption would preclude the maintenance of high operatingtemperatures.Others papers considered the no-wait scheduling problems when the processing times arecontrollable and unlimited (i.e. u k   ,j = +•). They are called blocking problems [7]. Typically, it ariseswhen we store products on machines or when we consider specific storage locations as resources. Insuch situations a product which has been completed may remain on the machine (or the resource) untila downstream machine becomes available. For instance, in airplane assembly lines, a plane can bmoved from an area to another only if this area is empty, otherwise it would stand and “block” themachine preventing another job from being processed in the engaged place.In others situations, it is allowed to store products on the machine during a limited time (i.e. l k   ,j • u k   ,j < +•). It is the case when scheduling a robot in an electroplating line [1]. The robot is used tomove a part from a chemical mixture to another. In this situation, chemical tanks are the resources, th“machines” of the system. Since the product is not allowed to stay outside a bath, the robot musttransport the product without delay. But products can stay for a short additional time (which isbounded) in a bath even if the chemical operation is performed. This introduces some flexibility in thscheduling process.Generally, blocking problems  and no-wait problems  are considered separately. Introducing theconstraint on controllability  of processing times, we are able to study them in an unique model. This isreally interesting since they have common properties as it is shown by this study. Furthermore, thismodel offers new possibilities. For example, if we consider each storage place as a machine with aprocessing time included in ]0; υ ], where 0 < υ  < +•, then it is possible to control WIP (Work-In-Process) through parameter υ .Some of the propositions hereafter hold in different situations. To give the most general account,we present the different cases even if there are not of th no-wait type. 2.   Notations and complexity results In this paper, we focus on  flow sho p and  job shop problems having the two characteristicsintroduced in the previous section. In these two   problems, we consider that n  jobs have to beprocessed. Job  j  consists of K  (  j )   operations performed in series on m different machines, with1   • m • K  (  j ). K = { } )(max 1  jK  n j ≤≤  is defined as the maximal number of operations performed on a job.While in the flow shop all the jobs go through each of th m machines in the same order ( m = K  ), in the job shop each job has its own process routing and a job use the same machine several times, which u k,j P k,j 0  l k,j
Similar documents
Related Search
We Need Your Support
Thank you for visiting our website and your interest in our free products and services. We are nonprofit website to share and download documents. To the running of this website, we need your help to support us.

Thanks to everyone for your continued support.

No, Thanks

We need your sign to support Project to invent "SMART AND CONTROLLABLE REFLECTIVE BALLOONS" to cover the Sun and Save Our Earth.

More details...

Sign Now!

We are very appreciated for your Prompt Action!