MPM Job-shop under Availability Constraints

Nozha Zribi, Luminița Duță, A. El Kamel

Abstract


A large part of scheduling literature assumes that machines are available all the time. In this paper, the MPM Job-shop scheduling problem, where the machine maintenance has to be performed within certain time intervals inducing machine unavailability, is studied. Two approaches to solve the problem are proposed. The first is a two-phase approach where the assignment and the sequencing are solved separately. The second is an integrated approach based on the exact resolution of the 2-job problem using the geometric approach.

Keywords


genetic algorithm, geometric approach, assignment heuristic

Full Text:

PDF

References


Adiri I., Bruno J., Frostig E., and Rinnooy Kan A. H. G. : Single machine flow-time with a single breakdown. Acta Informatica, 26, 679-696.
http://dx.doi.org/10.1007/BF00288977

S.B. Akers et J. Friedman. – A non-numerical approach to production scheduling problems. Operations Research, vol. 3, 1955, pp. 3, 429–442.
http://dx.doi.org/10.1287/opre.3.4.429

Aggoune, R.: Ordonnancement d'Ateliers sous Contraintes de Disponibilité des Machines(2002) Ph.D. Thesis, Université de Metz, France.

Aggoune, R.: Two-job shop Scheduling Problems with availability Constraints. ICAPS 2004, June 3-7, 2004, Whistler, British Columbia, Canada.

Duta, L.: Contribution ´r l'étude de la conduite des systˇcmes de désassemblage.These (2006). Université de Franche-Comté Université de Bucarest.

Duta,L., Filip, F. G. Henrioud,J.-M. Popescu: Disassembly Line Scheduling with Genetic Algorithms. Int. J. of Computers, Communications & Control, ISSN 1841-9836, E-ISSN 1841-9844 Vol. III (2008), No. 3, pp. 270-280.

Filip F.G., Neagu G. and Donciulescu D. (1983). Job shop scheduling optimization in real time production control. Computers in Industry, 4(4) (North Holland, Amsterdam), 395 - 403.
http://dx.doi.org/10.1016/0166-3615(83)90006-4

Ruiz-Torres AJ., Nakatani K.: Application of real-time simulation to assign due dates on logisticmanufacturing networks. Proceedings of the 1998 Winter Simulation Conference.

Blazewicz J., Breit J., Formanowicz P., Kubiak W., Schmidt G.: Heuristic algorithms for the twomachine flowshop problem with limited machine availability. Omega Journal (2001), 29, 599-608.
http://dx.doi.org/10.1016/S0305-0483(01)00048-2

Carlier J.: Scheduling jobs with release dates and tails on identical machines to minimize the makespan. European Journal of Operational research(1987), 29:298-306, North-Holland.
http://dx.doi.org/10.1016/0377-2217(87)90243-8

Carlier J.: The One-Machine Sequencing Problem, European Jounal of operational research(1982), 11: 42-47.

Jurisch B.: Scheduling Jobs in Shops with Multi Purpose Machines (1992) Ph.D Thesis, Universität Osnabrück.

J. Hurink, B. Jurisch et M. Thole. – Tabu search for the job-shop scheduling problem with multipurpose machines. Operations Research Spektrum, vol. 15, 1994, pp. 205–215.
http://dx.doi.org/10.1007/BF01719451

Kubiak W., Blazewicz J., Formanowicz P., Breit J., Schmidt G.: Two-machine flow shops with lim-ited machine availability. European Journal of Opera-tional Research (2002) 136: 528-540.
http://dx.doi.org/10.1016/S0377-2217(01)00083-2

Lee C.Y.: Machine scheduling with an availability constraint. Journal of Global Optimization(1996) 9: 395-416.
http://dx.doi.org/10.1007/BF00121681

Glover F., Laguna M.: Tabu search, Kluwer Publish- ers, Boston 1997.

Jurisch, B., (1995). Lower bounds for the job-shop scheduling problem on multi-purpose machines. Discrete Applied Mathematics, 58, 145-156.
http://dx.doi.org/10.1016/0166-218X(93)E0124-H

Lee C.Y.: Minimizing the mazkespan in two-machine flows-hop scheduling with availability constraint. Operations research letters (1997), 20: 129-139, .
http://dx.doi.org/10.1016/S0167-6377(96)00041-7

Lee C.Y.: Two-machine flowshop scheduling with availability constraints. European Journal of Opera-tional Research (1999), 114: 420-429.
http://dx.doi.org/10.1016/S0377-2217(97)00452-9

Lee KM., Yamakawa T.: A Genetic algorithm for general machine scheduling problems. Int.Conf. on Conventional and knowledge-Based Electronics Systems, Vol 2 pp60-66 Australia, 1998.
http://dx.doi.org/10.1109/kes.1998.725893

Mati, Y., and Xie, X.: Un algorithme polonimial pour le job shop flexible avec blocage : cas de deux jobs. Mosim'2003, April 23-25 april, Toulouse, France.

Mati, Y., and Xie, X.: The complexity of two-job shop problems with multi-purpose unrelated machines. European Journal of Operational Research, 152 (1), 159-169, 2004.
http://dx.doi.org/10.1016/S0377-2217(02)00675-6

Nowicki E., Smutnicki C.: A Fast Taboo Search Algorithm for the Job-Shop Problem, Management Science (1996), Vol. 42, No. 6, pp. 797-813.
http://dx.doi.org/10.1287/mnsc.42.6.797

Schmidt G.: Scheduling on semi identical processors. Z. Oper.Res.1984, A28, 153-162, .
http://dx.doi.org/10.1007/bf01920917

Schmidt G.: Scheduling independent tasks with deadlines on semi-identical processors. Journal of Operational research society, 39, 271-277, 1988.
http://dx.doi.org/10.1057/jors.1988.44

Sanjay J., William J. Foley :Impact of Interruptions of Schedule Execution in Flexible Manufacturing Systems. The International Journal of Flexible Manufacturing Systems, 14, 319-344, 2002.
http://dx.doi.org/10.1023/A:1020952823369

Roy B., Sussmann B.: Les probl'emes d'ordonnancement avec contraintes disjonctives (in French). Technical Report 9 bis, SEMA, Paris (France), December 1964.

Leon V. J., Wu S. D.: On scheduling with ready-times, due-dates and vacations. Naval Research Logistics, 39:53-65, 1992.
http://dx.doi.org/10.1002/1520-6750(199202)39:1<53::AID-NAV3220390105>3.0.CO;2-C

Schmidt G.: Scheduling with limited machine availability. European Journal of Operational Research (2000), 121, 1-15.
http://dx.doi.org/10.1016/S0377-2217(98)00367-1

Mauguiere Ph., Billaut J-C., Bouquard J-L.: New single machine and job-shop scheduling problems with availability constraints. Journal of Scheduling, 2004.

Zribi N. : Ordonnancement des job-shop flexibles sous contraintes de disponibilité des machines. PHD Thesis, Ecole Centrale de Lille, France, 2005.




DOI: https://doi.org/10.15837/ijccc.2009.4.2459



Copyright (c) 2017 Nozha Zribi, Luminița Duță, A. El Kamel

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.

 

 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2); Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.