Abstract
The problem of simultaneous determination of optimal due dates and optimal sequence for N-job single machine problem with multiple due dates is considered in this paper. The penalty for a job is assumed to be a linear function of the due date and the earliness/tardiness for the job. The objective is to minimize the total penalty for all jobs. An efficient optimal algorithm to solve the problem is developed and several results are provided.
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.
