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/12006| Title: | FH2(P 2,P2) hybrid flow shop scheduling with recirculation of jobs |
| Authors: | Nadjat, Meziani Mourad, Boudhar |
| Keywords: | Hybrid flow shop complexity recirculation makespan |
| Issue Date: | 6-Nov-2016 |
| Series/Report no.: | 2015; |
| Abstract: | Abstract. In this paper, two hybrid flow shop scheduling problems to minimize the makespan are presented. The first is the hybrid flow shop on two stages with only one machine on each stage and recirculation of jobs. This problem is polynomial. The second one is the hybrid flow shop on two stages such as each one contains two identical parallel machines and every job recirculates a finite number of times. This problem is NPhard in general. Linear mathematical formulation and heuristics are also presented with numerical experimentations. |
| URI: | http://dspace.univ-ouargla.dz/jspui/handle/123456789/12006 |
| Appears in Collections: | 1. Faculté des mathématiques et des sciences de la matière |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| FH2(P 2,P2) hybrid flow shop scheduling with.pdf | 700,2 kB | Adobe PDF | View/Open | |
| FH2(P 2,P2) hybrid flow shop scheduling with.pdf | 700,2 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.