One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy

In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed An algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed o...

Full description

Saved in:
Bibliographic Details
Main Author: Duffuaa, S. O. (author)
Other Authors: Raouf, A. (author), Bendaya, M. (author), Makki, M. (author), unknown (author)
Format: article
Published: 2020
Subjects:
Online Access:https://eprints.kfupm.edu.sa/id/eprint/1990/1/one_machine_scheduling_to_minimize_mean__duffuaa_isi_a1997wv66000004.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864513390215430144
author Duffuaa, S. O.
author2 Raouf, A.
Bendaya, M.
Makki, M.
unknown
author2_role author
author
author
author
author_facet Duffuaa, S. O.
Raouf, A.
Bendaya, M.
Makki, M.
unknown
author_role author
dc.creator.none.fl_str_mv Duffuaa, S. O.
Raouf, A.
Bendaya, M.
Makki, M.
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/1990/1/one_machine_scheduling_to_minimize_mean__duffuaa_isi_a1997wv66000004.pdf
One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy. PRODUCTION PLANNING CONTROL, 8. pp. 226-230.
dc.language.none.fl_str_mv en
dc.publisher.none.fl_str_mv TAYLOR FRANCIS LTD
dc.relation.none.fl_str_mv https://eprints.kfupm.edu.sa/id/eprint/1990/
http://isi.kfupm.edu.sa/journals/pdf/O/one_machine_scheduling_to_minimize_mean__duffuaa_isi_a1997wv66000004.pdf
dc.rights.*.fl_str_mv info:eu-repo/semantics/openAccess
dc.subject.none.fl_str_mv Systems
dc.title.none.fl_str_mv One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy
dc.type.none.fl_str_mv Article
PeerReviewed
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/article
description In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed An algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed optimal.
eu_rights_str_mv openAccess
format article
id KFUPM_3e9905b9cb75ad0c5ade618ceef9a607
identifier_str_mv One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy. PRODUCTION PLANNING CONTROL, 8. pp. 226-230.
language_invalid_str_mv en
network_acronym_str KFUPM
network_name_str King Fahd University of Petroleum and Minerals
oai_identifier_str oai::1990
publishDate 2020
publisher.none.fl_str_mv TAYLOR FRANCIS LTD
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number TardyDuffuaa, S. O.Raouf, A.Bendaya, M.Makki, M.unknownSystemsIn this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed An algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed optimal.TAYLOR FRANCIS LTDArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/1990/1/one_machine_scheduling_to_minimize_mean__duffuaa_isi_a1997wv66000004.pdf One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy. PRODUCTION PLANNING CONTROL, 8. pp. 226-230. enhttps://eprints.kfupm.edu.sa/id/eprint/1990/http://isi.kfupm.edu.sa/journals/pdf/O/one_machine_scheduling_to_minimize_mean__duffuaa_isi_a1997wv66000004.pdf2020info:eu-repo/semantics/openAccessoai::19902019-11-01T13:30:07Z
spellingShingle One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy
Duffuaa, S. O.
Systems
status_str publishedVersion
title One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy
title_full One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy
title_fullStr One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy
title_full_unstemmed One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy
title_short One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy
title_sort One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy
topic Systems
url https://eprints.kfupm.edu.sa/id/eprint/1990/1/one_machine_scheduling_to_minimize_mean__duffuaa_isi_a1997wv66000004.pdf