Abstract
This paper is concerned with two types of bicriterion stochastic scheduling problems, the first involving a single machine, and the second involving the m-machine flow shop. In both problems, types, a set of n jobs is to be processed on one or more machines, and the objective is to find a job sequence which minimizes the sum of the expected total weighted tardiness and the expected total weighted flowtime. The job processing times are independent random variables and the jobs have a common, random due date. For both problem types, an optimal job sequence is obtained by processing the jobs in increasing stochastic order of their processing times.
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.
