research-article

A hybrid metaheuristic algorithm for flexible job-shop scheduling problems with transportation constraints

Authors:

Herv� Manier,

Marie-Ange ManierAuthors Info & Claims

GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation

Pages 441 - 448

https://doi.org/10.1145/2330163.2330226

Published: 07 July 2012 Publication History

Abstract

In this paper, we aim at solving flexible job shop scheduling problems with transportation constraints and bounded processing times. We propose a hybrid method of genetic algorithm, tabu local search and a modified shifting bottleneck procedure. The genetic algorithm is used to generate and evolve assignment for each task (processing tasks and transportation tasks). The modified shifting bottleneck procedure is used to generate initial solutions and regenerate solutions when no improvement occurs during some generations. The tabu local search is then used to improve initial solutions during a limited number of iterations. To evaluate solutions, we elaborate a modified disjunctive graph which contains not only processing nodes, but also transportation and storage nodes. There are positive and negative arcs for bounded processing times, transportation times and minimum and maximum allowed storage time before and after each processing task. Our objective is to minimize makespan. Various types of instances with fixed or bounded processing times are tested. Computational results show that this hybrid method is able to solve efficiently these kinds of problems.

References

[1]

T. Abdelmaguid, A. Nassef, B. Kamal, and M. Hassan. A hybrid ga/heuristic approach to the simultaneous scheduling of machines and automated guided vehicles. International journal of production research, 42(2):267--281, 2004.

[2]

J. Adams, E. Balas, and D. Zawack. The shifting bottleneck procedure for job shop scheduling. Management science, 34(3):391--401, Mar. 1988.

Digital Library

[3]

�. Bilge and G. Ulusoy. A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Operations Research, 43(6):1058--1070, 1995.

Digital Library

[4]

J. Blazewicz, E. Pesch, and M. Sterna. The disjunctive graph machine representation of the job shop scheduling problem. European Journal of Operational Research, 127(2):317--331, 2000.

[5]

C. Bloch, C. Varnier, and P. Baptiste. Stochastic methods combined with a modified shifting bottleneck heuristic for solving a blocking scheduling problem with bounded processing times. In Proceedings of the 15th Triennal Conference of the International Federation of Operational Research Societies IFORS'99, pages 125--126, Beijing (China), 1999.

[6]

A. Che, C. Chu, and F. Chu. Multicyclic hoist scheduling with constant processing times. IEEE Transactions on Robotics and Automation, 18(1):69--80, 2002.

[7]

Y. Crama, V. Kats, J. V. de Klundert, and E. Levner. Cyclic scheduling in robotic flowshops. Annals of Operations Research, 96(1):97--124, 2000.

[8]

Y. Crama and J. Van de Klundert. Robotic flowshop scheduling is strongly np-complete. Technical Report 010, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization, 1997.

[9]

G. Dantzig and M. Thapa. Linear programming: theory and extensions, volume 2. Springer Verlag, 2003.

[10]

L. Deroussi, M. Gourgand, and N. Tchernev. A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles. International Journal of Production Research, 46(8):2143--2164, 2008.

[11]

L. Deroussi and S. Norre. Simultaneous scheduling of machines and vehicles for the flexible job shop problem. In International Conference on Metaheuristics and Nature Inspired Computing, 2010.

[12]

A. El Amraoui, M.-A. Manier, A. El Moudni, and M. Benrejeb. Heuristic for the resolution of the cyclic hoist scheduling problem with multi-items. In The 18th World Congress of the International Federation of Automatic Control (IFAC), volume 18, pages 8195--8200, 2011.

[13]

A. El Amraoui, M.-A. Manier, A. El Moudni, and M. Benrejeb. Hoist scheduling for multi-part chsp in complex lines' configuration. In 2011 IEEE International Conference on Industrial Technology (ICIT), pages 270--275. IEEE, 2011.

[14]

J. Hurink and S. Knust. Tabu search algorithms for job-shop problems with a single transport robot. European journal of operational research, 162(1):99--111, 2005.

[15]

P. Lacomme, M. Larabi, and N. Tchernev. A disjunctive graph for the job-shop with several robots. In MISTA Conference, pages 285--292, 2007.

[16]

J. Liu and Y. Jiang. An efficient optimal solution to the two-hoist no-wait cyclic scheduling problem. Operations Research, pages 313--327, 2005.

Digital Library

[17]

M. Mateo and R. Companys. New computational experiences on the hoist scheduling problem for cyclic manufacturing of different products. Technical report, Universitat Polit�cnica de Catalunya. Departament d'Organitzaci� d'Empreses Sense grup de recerca, 2007.

[18]

L. Phillips and P. Unger. Mathematical programming solution of a hoist scheduling program. AIIE Transactions, 8(2):219--225, 1976.

[19]

C. Rosse Bloch and P. Baptiste. Contribution � l'ordonnancement dynamique de lignes de traitement de surface. PhD thesis, Franche-Comt� university, 1999.

[20]

G. Shapiro and H. Nuttle. Hoist scheduling for a pcb electroplating facility. IIE transactions, 20(2):157--167, 1988.

[21]

Q. Zhang, H. Manier, and M.-A. Manier. A disjunctive graph and shifting bottleneck heuristics for multi hoists scheduling problem. In 18th World Congress of the International Federation of Automatic Control (IFAC), volume 18, pages 6963--6968, 2011.

[22]

Q. Zhang, H. Manier, and M.-A. Manier. A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Computers & Operations Research, 39:1713--1723, 2012.

Digital Library

[23]

Q. Zhang, H. Manier, M.-A. Manier, and C. Bloch. Proc�dure de shifting bottleneck avec graphe disjonctif pour le hoist scheduling problem. In 12e congr�s annuel de la soci�t� fran�aise de recherche op�rationnelle et d'aide � la d�cision, ROADEF, Mar. 2011.

Cited By

Alfred RYu H(2019)Automated Scheduling of Hostel Room Allocation Using Genetic AlgorithmData Management, Analytics and Innovation10.1007/978-981-32-9949-8_11(151-160)Online publication date: 25-Oct-2019
https://doi.org/10.1007/978-981-32-9949-8_11
Pereira JTeixeira APinto J(2015)Towards a hybrid NLG system for Data2Text in Portuguese2015 10th Iberian Conference on Information Systems and Technologies (CISTI)10.1109/CISTI.2015.7170419(1-6)Online publication date: Jun-2015
https://doi.org/10.1109/CISTI.2015.7170419
Pereira IMadureira A(2015)Racing based approach for Metaheuristics parameter tuning2015 10th Iberian Conference on Information Systems and Technologies (CISTI)10.1109/CISTI.2015.7170351(1-6)Online publication date: Jun-2015
https://doi.org/10.1109/CISTI.2015.7170351
Show More Cited By

Index Terms

A hybrid metaheuristic algorithm for flexible job-shop scheduling problems with transportation constraints
1. Computing methodologies
  1. Artificial intelligence
    1. Planning and scheduling

Recommendations

A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times

In this paper, we propose a model for Flexible Job Shop Scheduling Problem (FJSSP) with transportation constraints and bounded processing times. This is a NP hard problem. Objectives are to minimize the makespan and the storage of solutions. A genetic ...
A very fast TS/SA algorithm for the job shop scheduling problem

The job shop scheduling problem (JSP) is one of the most notoriously intractable NP-complete optimization problems. Over the last 10-15 years, tabu search (TS) has emerged as an effective algorithmic approach for the JSP. However, the quality of ...
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem

Tabu search (TS) algorithms are among the most effective approaches for solving the job shop scheduling problem (JSP) which is one of the most difficult NP-complete problems. However, neighborhood structures and move evaluation strategies play the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation

July 2012

1396 pages

ISBN:9781450311779

DOI:10.1145/2330163

Editor:
Terence Soule
University of Idaho, USA
,
General Chair:
Jason H. Moore
Dartmouth College, USA

Copyright � 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO '12

Sponsor:

SIGEVO

GECCO '12: Genetic and Evolutionary Computation Conference

July 7 - 11, 2012

Pennsylvania, Philadelphia, USA

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
248
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)1

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Alfred RYu H(2019)Automated Scheduling of Hostel Room Allocation Using Genetic AlgorithmData Management, Analytics and Innovation10.1007/978-981-32-9949-8_11(151-160)Online publication date: 25-Oct-2019
https://doi.org/10.1007/978-981-32-9949-8_11
Pereira JTeixeira APinto J(2015)Towards a hybrid NLG system for Data2Text in Portuguese2015 10th Iberian Conference on Information Systems and Technologies (CISTI)10.1109/CISTI.2015.7170419(1-6)Online publication date: Jun-2015
https://doi.org/10.1109/CISTI.2015.7170419
Pereira IMadureira A(2015)Racing based approach for Metaheuristics parameter tuning2015 10th Iberian Conference on Information Systems and Technologies (CISTI)10.1109/CISTI.2015.7170351(1-6)Online publication date: Jun-2015
https://doi.org/10.1109/CISTI.2015.7170351
Deroussi L(2014)A Hybrid PSO Applied to the Flexible Job Shop with TransportSwarm Intelligence Based Optimization10.1007/978-3-319-12970-9_13(115-122)Online publication date: 28-Nov-2014
https://doi.org/10.1007/978-3-319-12970-9_13

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents