NEW HEURISTICS FOR MINIMISING TOTAL COMPLETION TIME AND THE NUMBER OF TARDY JOBS CRITERIA ON A SINGLE MACHINE WITH RELEASE TIME
DOI:
https://doi.org/10.7166/21-2-53Keywords:
NP-Hard, HR9 and HR10, HR7, posteriori approach,Abstract
ENGLISH ABSTRACT: This paper considers the bi-criteria scheduling problem of simultaneously minimising the total completion time and the number of tardy jobs with release dates on a single machine. Since the problem had been classified as NP-Hard, two heuristics (HR9 and HR10) were proposed for solving this problem. Performance evaluations of the proposed heuristics and selected solution methods (HR7 and BB) from the literature were carried out on 1,100 randomly generated problems ranging from 3 to 500 jobs. Experiment results show that HR7 outperformed HR10 when the number of jobs (n) is less than 30, while HR10 outperformed HR7 for n? 30.
AFRIKAANSE OPSOMMING: In hierdie artikel word die bi-kriteria-skeduleringsprobleem bestudeer waar die totale voltooiingstyd en die aantal take wat laat is op
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish in the Journal agree to the following terms:- Authors retain copyright and grant the Journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this Journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the Journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this Journal.