摘要：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.
