Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9664037 | European Journal of Operational Research | 2005 | 11 Pages |
Abstract
We develop in this paper a generic and precise identification of a scheduling problem in a flexible manufacturing system. We consider a flowshop robotic cell that processes several jobs. We assume that there is no intermediate buffer between machines. So, jobs may be blocked when downstream machines are busy. We present an integer programming model to determine the sequence of jobs that minimizes the makespan criterion. In order to solve large size problems, we propose a genetic algorithm (GA). Finally, computational experiments are proposed in order to compare the makespan returned by the GA to a lower bound.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
A. Soukhal, P. Martineau,