Abstract
A problem of scheduling n jobs with exponential processing times on a single machine is discussed, the objective is to find an optimal schedule to minimize the expectation of total weighted absolute deviations of completion times about a deterministic common due date. This problem is a typical scheduling model in just-in-time manufacturing system where both earliness penalties and tardiness penalties are considered. The deterministic equivalent of the objective function is derived, and /spl Lambda/-shaped property, with respect to the products of jobs' weights and their processing time rates, of the optimal schedules of this problem is established. The /spl Lambda/-shaped property of the optimal schedule can reduce the candidates of optimal schedule from n! to 2/sup n/.
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.
