Documents disponibles écrits par cet auteur

A modified tabu search algorithm for cost-based job shop problem / Z. C. Zhu in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 611–619 Titre : A modified tabu search algorithm for cost-based job shop problem Type de document : texte imprimé Auteurs : Z. C. Zhu, Auteur ; K. M. Ng, Auteur ; H. L. Ong, Auteur Année de publication : 2010 Article en page(s) : pp. 611–619 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Job  shop  problem  Cost-based  problem  Tabu  search  Neighbourhood  structure  Memory  structure  Filter  structure Index. décimale : 001.424 Résumé : In this paper, a cost-based job shop problem (JIT-JSP) is proposed to model the multi-order processing procedure in a just-in-time (JIT) environment. The objective of JIT-JSP is to minimize three costs: work-in-process holding cost of half-finished orders, inventory holding cost of finished orders and backorder cost of unfulfilled orders. A modified tabu search (MTS) method is developed to improve the schedule quality by searching the neighbourhood of a feasible schedule iteratively. The MTS method is comprised of three components that help to ensure a more effective searching procedure: neighbourhood structure, memory structure and filter structure. Computational results show that the MTS method significantly improves the initial schedule generated by an arbitrarily selected dispatching rule. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors20099a.html [article] A modified tabu search algorithm for cost-based job shop problem [texte imprimé] / Z. C. Zhu, Auteur ; K. M. Ng, Auteur ; H. L. Ong, Auteur . - 2010 . - pp. 611–619. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 611–619 Mots-clés : Job  shop  problem  Cost-based  problem  Tabu  search  Neighbourhood  structure  Memory  structure  Filter  structure Index. décimale : 001.424 Résumé : In this paper, a cost-based job shop problem (JIT-JSP) is proposed to model the multi-order processing procedure in a just-in-time (JIT) environment. The objective of JIT-JSP is to minimize three costs: work-in-process holding cost of half-finished orders, inventory holding cost of finished orders and backorder cost of unfulfilled orders. A modified tabu search (MTS) method is developed to improve the schedule quality by searching the neighbourhood of a feasible schedule iteratively. The MTS method is comprised of three components that help to ensure a more effective searching procedure: neighbourhood structure, memory structure and filter structure. Computational results show that the MTS method significantly improves the initial schedule generated by an arbitrarily selected dispatching rule. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors20099a.html