1. DSpace at Kasdi Merbah University Ouargla
  2. 6. Scientific publications
  3. Publications Nationales
  4. 1. Faculté des mathématiques et des sciences de la matière
Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/12006
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNadjat, Meziani-
dc.contributor.authorMourad, Boudhar-
dc.date.accessioned2016-11-06T10:48:41Z-
dc.date.available2016-11-06T10:48:41Z-
dc.date.issued2016-11-06-
dc.identifier.urihttp://dspace.univ-ouargla.dz/jspui/handle/123456789/12006-
dc.description.abstractAbstract. 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.en_US
dc.description.sponsorshipuniv ouarglaen_US
dc.language.isoenen_US
dc.relation.ispartofseries2015;-
dc.subjectHybrid flow shopen_US
dc.subjectcomplexityen_US
dc.subjectrecirculationen_US
dc.subjectmakespanen_US
dc.titleFH2(P 2,P2) hybrid flow shop scheduling with recirculation of jobsen_US
dc.typeArticleen_US
Appears in Collections:1. Faculté des mathématiques et des sciences de la matière

Files in This Item:
File Description SizeFormat 
FH2(P 2,P2) hybrid flow shop scheduling with.pdf700,2 kBAdobe PDFView/Open
FH2(P 2,P2) hybrid flow shop scheduling with.pdf700,2 kBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.