Abstract
This paper presents a simulated genetic algorithm model of scheduling the flow shop problems with re-entrant jobs. The objectives of this research are to minimize the weighted tardiness and makespan. The proposed model considers that the jobs with non-identical due dates are processed on the machines with the same order. Furthermore, the re-entrant jobs are stochastic as only some jobs are required to reenter to the flow shop. The tardiness weight is adjusted once the jobs re-enter the shop. The performance of the proposed GA model is verified by a number of numerical experiments where the data come from the case company. The results show the proposed method has a higher order satisfaction rate than the industrial practices.
| Original language | English |
|---|---|
| Title of host publication | IEEM2010 - IEEE International Conference on Industrial Engineering and Engineering Management |
| Pages | 1240-1245 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - 1 Dec 2010 |
| Externally published | Yes |
| Event | IEEE International Conference on Industrial Engineering and Engineering Management, IEEM2010 - Macao, China Duration: 7 Dec 2010 → 10 Dec 2010 |
Conference
| Conference | IEEE International Conference on Industrial Engineering and Engineering Management, IEEM2010 |
|---|---|
| Country/Territory | China |
| City | Macao |
| Period | 7/12/10 → 10/12/10 |
Keywords
- Bi-objective
- Flow shop
- Genetic algorithm
- Re-entrant
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering