Abstract
Given a set of n jobs with deterministic processing times and the same ready times, the problem is to find the optimal common flow allowance k∗ for the common due-date assignment method, and the optimal job sequence σ∗ to minimize a penalty function of missing due-dates. It is assumed that penalty will not occur if the deviation of job completion from the due-date is sufficiently small. Three lemmas are presented and a numerical example is provided to illustrate the use of the results to determine the optimal solution to the due-date determination and sequencing problem.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
