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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/1963/1/minimizing_mean_tardiness_subject_to_uns_bendaya_isi_a1996ue47100007.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|