Skip to Main content Skip to Navigation
Conference papers

An Iterative Greedy Insertion Technique for Flexible Job Shop Scheduling Problem

Abstract : This paper studies the problem of scheduling in a flexible job shop. A greedy heuristic is developed to solve precisely the sequencing (allocation) problem. The principle of this approach is to iteratively insert operations on the machines until the objective of minimizing the Cmax (makespan) is reached. The heuristic was tested on a particular Benchmark which considers the transportation times between the machines, and get inspiration from a real assembly cell: the AIP-PRIMECA cell at the University of Valenciennes, that from an OR perspective, can be viewed as Flexible Job Shop, leading to the formulation of a Flexible Job-Shop Scheduling Problem (FJSSP). The results obtained by the greedy heuristic on this benchmark are very promising.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03406967
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Thursday, October 28, 2021 - 10:58:32 AM
Last modification on : Wednesday, November 3, 2021 - 3:56:50 AM

Identifiers

  • HAL Id : hal-03406967, version 1

Collections

Citation

Azzedine Bekkar, Oualid Guemri, Abdelghani Bekrar, Nassima Aissani, Bouziane Beldjilali, et al.. An Iterative Greedy Insertion Technique for Flexible Job Shop Scheduling Problem. 8th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2016, Dec 2016, Troyes, France. pp.1956-1961. ⟨hal-03406967⟩

Share

Metrics

Record views

8