A Single-machine Scheduling with Generalized Due Dates to Minimize Total Weighted Late Work
Myoung-Ju Park & Byung-Cheon Choi · Asian Research Journal of Mathematics · 2022
In the paper, we consider a single-machine scheduling problem with generalized due dates, in which the objective is to minimize total weighted work. This problem was proven to be NP-hard by Mosheiov et al. [1]. However, the exact complexity remains open. We show that the problem...
Open access
Research Article
10.9734/arjom/2022/v18i430368