Feedback

Faculté des Sciences appliquées
Faculté des Sciences appliquées
MASTER THESIS
VIEW 67 | DOWNLOAD 106

Master Thesis : Optimization Strategies for Industrial-size Job Shop Scheduling

Download
Boveroux, Laurie ULiège
Promotor(s) : Louveaux, Quentin ULiège
Date of defense : 26-Jun-2023/27-Jun-2023 • Permalink : http://hdl.handle.net/2268.2/17710
Details
Title : Master Thesis : Optimization Strategies for Industrial-size Job Shop Scheduling
Author : Boveroux, Laurie ULiège
Date of defense  : 26-Jun-2023/27-Jun-2023
Advisor(s) : Louveaux, Quentin ULiège
Committee's member(s) : Fontaine, Pascal ULiège
Derval, Guillaume ULiège
Language : English
Number of pages : 123
Discipline(s) : Engineering, computing & technology > Computer science
Institution(s) : Université de Liège, Liège, Belgique
Degree: Master : ingénieur civil en science des données, à finalité spécialisée
Faculty: Master thesis of the Faculté des Sciences appliquées

Abstract

[fr] This thesis investigates the optimization of a large-scale job shop scheduling process.
Scheduling plays a crucial role in resource allocation and productivity maximization for companies. We evaluate the performance of established optimization techniques, including simulated annealing, branch and bound, dive, and a relaxation with a linear program we call the ranking method. We use three instances from the database of TOOWHE Enterprise Resource Planning (ERP) software, developed by Hi-pass.
Through extensive experimentation on three instances of industrial-scale job shop problems, we assess the effectiveness and limitations of each algorithm. The simulated annealing algorithm shows promise by achieving significant objective value improvements within a reasonable execution time. However, the ranking method quickly outperforms it, providing equivalent solutions in a fraction of a second. By solving a relaxation of the problem with a linear program, the ranking method provides lower bounds and generates efficient operation schedules. To overcome the limitations of the branch and bound method, we propose the dive approach, which allows deeper exploration of the solution space while maintaining model consistency. By incorporating different strategies for operation selection, the dive approach achieves high-quality schedules within a limited number of dives. Our results highlight the limited scalability of the branch and bound method and the effectiveness of the simulated annealing algorithm, ranking method, and dive approach in generating reliable initial schedules. We recommend using the ranking method or dive approach to obtain an initial schedule and applying the simulated annealing algorithm for further refinement. This research contributes to the advancement of scheduling optimization in ERP systems, providing insights into algorithm performance and practical recommendations for improving scheduling efficiency and resource utilization in industrial contexts.


File(s)

Document(s)

File
Access Laurie_Boveroux_Abstract.pdf
Description:
Size: 71.16 kB
Format: Adobe PDF
File
Access Laurie_Boveroux_Thesis.pdf
Description:
Size: 4.77 MB
Format: Adobe PDF

Author

  • Boveroux, Laurie ULiège Université de Liège > Master ingé. civ. sc. don. à . fin.

Promotor(s)

Committee's member(s)

  • Fontaine, Pascal ULiège Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Systèmes informatiques distribués
    ORBi View his publications on ORBi
  • Derval, Guillaume ULiège Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Smart grids
    ORBi View his publications on ORBi
  • Total number of views 67
  • Total number of downloads 106










All documents available on MatheO are protected by copyright and subject to the usual rules for fair use.
The University of Liège does not guarantee the scientific quality of these students' works or the accuracy of all the information they contain.