Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work

Rubing Chen, Yuan Gao, Zhichao Geng, Jinjiang Yuan

Year of publication:	2023
Authors:	Chen, Rubing ; Gao, Yuan ; Geng, Zhichao ; Yuan, Jinjiang
Subject:	algorithms \| assignable/generalized due dates \| NP-hard \| Scheduling \| total weighted late work \| Scheduling-Verfahren \| Scheduling problem \| Algorithmus \| Algorithm \| Theorie \| Theory \| Durchlaufzeit \| Lead time

Online Resource

Check full text access |

More access options

doi.org

Check Google Scholar

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10014383411

A service of the