Comparison between two approaches to solve the Job-shop Scheduling Problem with Routing - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Conference Papers Year : 2019

Comparison between two approaches to solve the Job-shop Scheduling Problem with Routing

Abstract

This paper is a comparison between two approaches using the TLH evaluation, the first approach is an integrated approach permitting to find high quality solutions in terms of makespan but requiring high computational time. The second approach is a sequential approach in which the TLH evaluation is performed only on the best solution according to the makespan criteria, the TLH evaluation included in a sequential approach permits to obtain a solution maximizing the QoS with a low computational time.
No file

Dates and versions

hal-02181541 , version 1 (12-07-2019)

Identifiers

  • HAL Id : hal-02181541 , version 1

Cite

Matthieu Gondran, Marie-José Huguet, Philippe Lacomme, Nikolay Tchernev. Comparison between two approaches to solve the Job-shop Scheduling Problem with Routing. 9th Manufacturing Modelling, Management and Control (MIM), Aug 2019, Berlin, Germany. ⟨hal-02181541⟩
107 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More