Une étude d'approches heuristiques pour l'ordonnancement des jobs dans le flowshop = A study of heuriotics approach for schedullng jobs within the flowshopLEMLOUMA, Tayeb.RIST. 2001, Vol 11, Num 2, pp 4-5, issn 1111-0015, 9, 69-82 [17 p.]Article

Movement minimization for unit distances in conveyor flow shop processingESPELAGE, W; WANKE, E.Mathematical methods of operations research (Heidelberg). 2003, Vol 57, Num 2, pp 173-206, issn 1432-2994, 34 p.Article

A 3-approximation algorithm for movement minimization in conveyor flow shop processingESPELAGE, Wolfgang; WANKE, Egon.Lecture notes in computer science. 2001, pp 363-374, issn 0302-9743, isbn 3-540-42496-2Conference Paper

Heuristic algorithms for the two-machine flowshop with limited machine availabilityBŁAZEWICZ, Jacek; BREIT, Joachim; FORMANOWICZ, Piotr et al.Omega (Oxford). 2001, Vol 29, Num 6, pp 599-608, issn 0305-0483Article

No-wait flexible flowshop scheduling with no-idle machinesZHENBO WANG; WENXUN XING; FENGSHAN BAI et al.Operations research letters. 2005, Vol 33, Num 6, pp 609-614, issn 0167-6377, 6 p.Article

A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility : Flowshop scheduling researchRUIZ, Rubén; MAROTO, Concepcion.European journal of operational research. 2006, Vol 169, Num 3, pp 781-800, issn 0377-2217, 20 p.Article

Applying machine based decomposition in 2-machine flow shops : Flowshop scheduling researchMUKHERJEE, Saral; CHATTERJEE, A. K.European journal of operational research. 2006, Vol 169, Num 3, pp 723-741, issn 0377-2217, 19 p.Article

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspectiveRIBAS, Imma; LEISTEN, Rainer; FRAMINAN, Jose M et al.Computers & operations research. 2010, Vol 37, Num 8, pp 1439-1454, issn 0305-0548, 16 p.Article

Solving hybrid flow shop problem using energetic reasoning and global operationsNERON, Emmanuel; BAPTISTE, Philippe; GUPTA, Jatinder N. D et al.Omega (Oxford). 2001, Vol 29, Num 6, pp 501-511, issn 0305-0483Article

Some heuristics for no-wait flowshops with total tardiness criterionGENGCHENG LIU; SHIJI SONG; CHENG WU et al.Computers & operations research. 2013, Vol 40, Num 2, pp 521-525, issn 0305-0548, 5 p.Article

Performance enhancement by using non-permutation schedules in flowline-based manufacturing systemsPUGAZHENDHI, S; THIAGARAJAN, S; RAJENDRAN, C et al.Computers & industrial engineering. 2003, Vol 44, Num 1, pp 133-157, issn 0360-8352, 25 p.Article

Une procédure par évaluation et séparation basée sur une analyse Max-Plus du flowshop = Procedure by evaluation and separation based flowshop Max-plus analysisLENTE, Ch; BILLAUT, J. C; BOUQUARD, J. L et al.Journées nationales sur la résolution pratique de problèmes NP-complets. 2002, pp 271-272, isbn 2-7261-1208-0, 2 p.Conference Paper

A note on scheduling problems with learning effect and deteriorating jobsWANG, J.-B.International journal of systems science. 2006, Vol 37, Num 12, pp 827-833, issn 0020-7721, 7 p.Article

Experimental genetic operators analysis for the multi-objective permutation flowshopBRIZUELA, Carlos A; ACEVES, Rodrigo.Lecture notes in computer science. 2003, pp 578-592, issn 0302-9743, isbn 3-540-01869-7, 15 p.Conference Paper

Project management and schedulingWALLS, Vincente; WEGLARZ, Jan.European journal of operational research. 2005, Vol 165, Num 2, issn 0377-2217, 270 p.Conference Proceedings

An efficient constructive heuristic for flowtime minimisation in permutation flow shopsFRAMINAN, J. M; LEISTEN, R.Omega (Oxford). 2003, Vol 31, Num 4, pp 311-317, issn 0305-0483, 7 p.Article

Parallel partitioning method (PPM) : A new exact method to solve bi-objective problemsLEMESRE, J; DHAENENS, C; TALBI, E. G et al.Computers & operations research. 2007, Vol 34, Num 8, pp 2450-2462, issn 0305-0548, 13 p.Article

K-PPM: A new exact method to solve multi-objective combinatorial optimization problemsDHAENENS, C; LEMESRE, J; TALBI, E. G et al.European journal of operational research. 2010, Vol 200, Num 1, pp 45-53, issn 0377-2217, 9 p.Article

Trading off between makespan and customer responsiveness in flow shop sequencingCOHN, Amy; KURNAZ, Selin; YIHAN GUAN et al.International journal of production research. 2010, Vol 48, Num 21-22, pp 6777-6797, issn 0020-7543, 21 p.Article

A heuristic to minimize total flow time in permutation flow shopLAHA, Dipak; SARIN, Subhash C.Omega (Oxford). 2009, Vol 37, Num 3, pp 734-739, issn 0305-0483, 6 p.Article

Complexity of the job insertion problem in multi-stage schedulingVESTJENS, Arjen P. A; WENNINK, Marc; WOEGINGER, Gerhard J et al.Operations research letters. 2007, Vol 35, Num 6, pp 754-758, issn 0167-6377, 5 p.Article

Complexity of flowshop scheduling problems with a new blocking constraint : Flowshop scheduling researchMARTINEZ, S; DAUZERE-PERES, S; GUERET, C et al.European journal of operational research. 2006, Vol 169, Num 3, pp 855-864, issn 0377-2217, 10 p.Article

Articles presented at the Conference on Routing and Location (CORAL), Tenerife, February 2003SALAZAR GONZALEZ, Juan José.Computers & operations research. 2005, Vol 32, Num 12, issn 0305-0548, 207 p.Conference Proceedings

Ordonnancement de la production et de la maintenance : Cas d'un atelier de type Flow Shop à deux machines = Production and maintenance scheduling: case of a flow shop workshop with two machinesKAABI, Jihene; VARNIER, Christophe; ZERHOUNI, Noureddine et al.Journal européen des systèmes automatisés. 2003, Vol 37, Num 5, pp 641-660, issn 1269-6935, 20 p.Conference Paper

Algorithmes génétiques multicritères pour les problèmes de flowshop = Multicriteria genetic algorithm for the flowshop problemsMABED, M. H; RAHOUAL, M; TALBI, E. G et al.MOSIM '01 : conference francophone de modélisation et simulation. 2001, isbn 1-56555-212-1, 3Vol, V2, 843-849Conference Paper