FH 2(P 2,P 2)  hybrid flow  shop scheduling with recirculation of jobs

Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/2873

Full metadata record

DC Field	Value	Language
dc.contributor.author	Nadjat Meziani1 and Mourad Boudhar2	-
dc.date.accessioned	2013-12-19T15:13:36Z	-
dc.date.available	2013-12-19T15:13:36Z	-
dc.date.issued	2013-12-19	-
dc.identifier.issn	kh	-
dc.identifier.uri	http://hdl.handle.net/123456789/2873	-
dc.description	7 ieme Colloque sur l Optimisation et les Systèmes d’Information COSI 2010 18-20 Avril 2010	en_US
dc.description.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 NP- hard in general. Linear mathematical formulation and heuristics are also presented with numerical experimentations	en_US
dc.language.iso	en	en_US
dc.subject	Hybrid flow shop	en_US
dc.subject	complexity	en_US
dc.subject	recirculation	en_US
dc.subject	makespan	en_US
dc.title	FH 2(P 2,P 2) hybrid flow shop scheduling with recirculation of jobs	en_US
dc.type	Article	en_US
Appears in Collections:	1. Faculté des mathématiques et des sciences de la matière

Files in This Item:

File	Description	Size	Format
Nadjat Meziani.pdf		701,38 kB	Adobe PDF	View/Open

DSpace JSPUI