![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
Given a set of n independent jobs with deterministic processing times and the same ready times, the problem is to find the optimal processing-time multiple k∗ for the TWK-power due-date assignment method, and the optimal job sequence σ∗ to minimize a total cost function. It is found that k∗ is a function of job sequence and σ∗ should be in SPT sequence. After the theoretical treatment, a numerical example is given for discussion.
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
