Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine
In this paper we propose a hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs. Although the minimum number of tardy jobs is known, the subset of tardy job is not known. The proposed algorithm use...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | article |
| منشور في: |
2020
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/1963/1/minimizing_mean_tardiness_subject_to_uns_bendaya_isi_a1996ue47100007.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513390202847232 |
|---|---|
| author | Duffuaa, S. O. |
| author2 | Bendaya, M Raouf, A. unknown |
| author2_role | author author author |
| author_facet | Duffuaa, S. O. Bendaya, M Raouf, A. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Duffuaa, S. O. Bendaya, M Raouf, A. unknown |
| dc.date.*.fl_str_mv | 2020 |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/1963/1/minimizing_mean_tardiness_subject_to_uns_bendaya_isi_a1996ue47100007.pdf Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 89. pp. 100-107. |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | ELSEVIER SCIENCE BV |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/1963/ http://isi.kfupm.edu.sa/journals/pdf/M/minimizing_mean_tardiness_subject_to_uns_bendaya_isi_a1996ue47100007.pdf |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Systems |
| dc.title.none.fl_str_mv | Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | In this paper we propose a hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs. Although the minimum number of tardy jobs is known, the subset of tardy job is not known. The proposed algorithm uses traditional branch and bound scheme where lower bounds on mean tardiness are calculated coupled with using the information that the number of tardy jobs is known. It also uses an insertion algorithm which determines the optimal mean tardiness once the subset of tardy jobs is specified. An example is solved to illustrate the developed procedure. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_78901ade59f6fdec889ad30fa9da49f8 |
| identifier_str_mv | Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 89. pp. 100-107. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::1963 |
| publishDate | 2020 |
| publisher.none.fl_str_mv | ELSEVIER SCIENCE BV |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single MachineDuffuaa, S. O.Bendaya, MRaouf, A.unknownSystemsIn this paper we propose a hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs. Although the minimum number of tardy jobs is known, the subset of tardy job is not known. The proposed algorithm uses traditional branch and bound scheme where lower bounds on mean tardiness are calculated coupled with using the information that the number of tardy jobs is known. It also uses an insertion algorithm which determines the optimal mean tardiness once the subset of tardy jobs is specified. An example is solved to illustrate the developed procedure.ELSEVIER SCIENCE BVArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/1963/1/minimizing_mean_tardiness_subject_to_uns_bendaya_isi_a1996ue47100007.pdf Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 89. pp. 100-107. enhttps://eprints.kfupm.edu.sa/id/eprint/1963/http://isi.kfupm.edu.sa/journals/pdf/M/minimizing_mean_tardiness_subject_to_uns_bendaya_isi_a1996ue47100007.pdf2020info:eu-repo/semantics/openAccessoai::19632019-11-01T13:29:57Z |
| spellingShingle | Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine Duffuaa, S. O. Systems |
| status_str | publishedVersion |
| title | Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine |
| title_full | Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine |
| title_fullStr | Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine |
| title_full_unstemmed | Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine |
| title_short | Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine |
| title_sort | Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine |
| topic | Systems |
| url | https://eprints.kfupm.edu.sa/id/eprint/1963/1/minimizing_mean_tardiness_subject_to_uns_bendaya_isi_a1996ue47100007.pdf |