Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
