Scheduling of Jobs with Multiple Weights on a Single Machine for Minimizing the Total Weighted Number of Tardy Jobs

We consider the scheduling of jobs with multiple weights on a single machine for minimizing the total weighted number of tardy jobs. In this setting, each job has <i>m</i> weights (or equivalently, the jobs have <i>m</i> weighting vectors), and thus we have <i>m</i&g...

Full description

Bibliographic Details
Published in:Mathematics
Main Authors: Shuen Guo, Hao Lang, Hanxiang Zhang
Format: Article
Language:English
Published: MDPI AG 2023-02-01
Subjects:
scheduling
pareto-optimal points
multi-weights
tardy jobs
Online Access:https://www.mdpi.com/2227-7390/11/4/1013

Internet

https://www.mdpi.com/2227-7390/11/4/1013

Similar Items