Documents disponibles écrits par cet auteur

Parallel machine scheduling with common due windows / R.-H. Huang 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. 640–646 Titre : Parallel machine scheduling with common due windows Type de document : texte imprimé Auteurs : R.-H. Huang, Auteur ; C-L. Yang, Auteur ; H-T. Huang, Auteur Année de publication : 2010 Article en page(s) : pp. 640–646 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Operation  scheduling  Parallel  machine  Due  windows  On-time Index. décimale : 001.424 Résumé : With the prevalence of on-time scheduling, timely product submission has become a crucial contributor to customer satisfaction. Studies examining on-time scheduling primarily seek to determine the minimum weighted sum of earliness and tardiness penalties. This study assumes that all machines are identical. Furthermore, this study assumes that jobs are independent and share a common due date window when investigating scheduling problems involving parallel machines with a minimum total number of early and tardy jobs (or maximum number of on-time jobs). This study presents related theorems and a novel simplified algorithm based on the problem. Additionally, rule characteristics are examined, and simulated data are used to verify the effectiveness and timeliness of the proposed algorithm. The theoretical proof and data test results all indicate that the proposed approach obtains the best solution within the shortest time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008184a.html [article] Parallel machine scheduling with common due windows [texte imprimé] / R.-H. Huang, Auteur ; C-L. Yang, Auteur ; H-T. Huang, Auteur . - 2010 . - pp. 640–646. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 640–646 Mots-clés : Operation  scheduling  Parallel  machine  Due  windows  On-time Index. décimale : 001.424 Résumé : With the prevalence of on-time scheduling, timely product submission has become a crucial contributor to customer satisfaction. Studies examining on-time scheduling primarily seek to determine the minimum weighted sum of earliness and tardiness penalties. This study assumes that all machines are identical. Furthermore, this study assumes that jobs are independent and share a common due date window when investigating scheduling problems involving parallel machines with a minimum total number of early and tardy jobs (or maximum number of on-time jobs). This study presents related theorems and a novel simplified algorithm based on the problem. Additionally, rule characteristics are examined, and simulated data are used to verify the effectiveness and timeliness of the proposed algorithm. The theoretical proof and data test results all indicate that the proposed approach obtains the best solution within the shortest time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008184a.html