Documents disponibles écrits par cet auteur

Job scheduling in virtual manufacturing cells with lot-streaming strategy: a new mathematical model formulation and a genetic algorithm approach / S. E. Kesen in Journal of the operational research society (JORS), Vol. 63 N° 5 (Mai 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 5 (Mai 2012) . - pp. 683–695 Titre : Job scheduling in virtual manufacturing cells with lot-streaming strategy: a new mathematical model formulation and a genetic algorithm approach Type de document : texte imprimé Auteurs : S. E. Kesen, Auteur ; Z. Güngör, Auteur Année de publication : 2012 Article en page(s) : pp. 683–695 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Virtual  manufacturing  cells  (VMCs)  Flexible  job-shop  scheduling  problem  Lot-streaming  Integer  programming  Genetic  algorithms Index. décimale : 001.424 Résumé : This paper discusses the job scheduling problem in virtual manufacturing cells (VMCs) with the objective of makespan minimization. In the VMC scheduling problem, each job undergoes different processing routes and there is a set of machines to process any operation. Jobs are produced in lot and lot-streaming is permitted. In addition, machines are distributed through the facility, which raises the travelling time issue. For this reason, the decisions are machine assignments, starting times and sub-lot sizes of the operations. We develop a new Mixed Integer Linear Programming (MILP) formulation that considers all aspects of the problem. Owing to the intractability matter, it is unlikely that the MILP could provide solutions for big-sized instances within a reasonable amount of time. We therefore present a Genetic Algorithm (GA) with a new chromosome structure for the VMC environment. Based on a wide range of examinations, comparative results show that GA is quite favourable and that it obtains the optimum solution for any of the instances in the case where sub-lot number equals 1. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n5/abs/jors201186a.html [article] Job scheduling in virtual manufacturing cells with lot-streaming strategy: a new mathematical model formulation and a genetic algorithm approach [texte imprimé] / S. E. Kesen, Auteur ; Z. Güngör, Auteur . - 2012 . - pp. 683–695. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 5 (Mai 2012) . - pp. 683–695 Mots-clés : Scheduling  Virtual  manufacturing  cells  (VMCs)  Flexible  job-shop  scheduling  problem  Lot-streaming  Integer  programming  Genetic  algorithms Index. décimale : 001.424 Résumé : This paper discusses the job scheduling problem in virtual manufacturing cells (VMCs) with the objective of makespan minimization. In the VMC scheduling problem, each job undergoes different processing routes and there is a set of machines to process any operation. Jobs are produced in lot and lot-streaming is permitted. In addition, machines are distributed through the facility, which raises the travelling time issue. For this reason, the decisions are machine assignments, starting times and sub-lot sizes of the operations. We develop a new Mixed Integer Linear Programming (MILP) formulation that considers all aspects of the problem. Owing to the intractability matter, it is unlikely that the MILP could provide solutions for big-sized instances within a reasonable amount of time. We therefore present a Genetic Algorithm (GA) with a new chromosome structure for the VMC environment. Based on a wide range of examinations, comparative results show that GA is quite favourable and that it obtains the optimum solution for any of the instances in the case where sub-lot number equals 1. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n5/abs/jors201186a.html