DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/11960| Title: | Flow shop Problem with transportation considerations |
| Authors: | Nacira, Chikhi Mourad, Boudhar |
| Keywords: | Scheduling flow shop tranport makespan heuristics |
| Issue Date: | 6-Nov-2016 |
| Series/Report no.: | 2015; |
| Abstract: | Abstract. Motivated by applications in manufacturing systems. This paper deals with a scheduling problem of independent tasks with addi- tional constraints (transportation times), where the objective is to minimize the total completion time. This problem arises in automated cells and is a complex flow shop problem with a transportation robot or conveyor. Since the problem is NP-hard, heuristics are developed to give near optimal solutions. Two new programming algorithms are also proposed for solving some special cases of this problem. Finally, we evaluate the proposed heuristics, giving experimental results on randomly generated test problems. |
| URI: | http://dspace.univ-ouargla.dz/jspui/handle/123456789/11960 |
| Appears in Collections: | 1. Faculté des mathématiques et des sciences de la matière |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Flow shop Problem with transporation consideration.pdf | 666,34 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.