Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Multi-objective Scheduling with Stochastic Processing Times

  • Published : 1995.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

A multi-objective, single-stage scheduling problem with stochastic processing times is considered where the objective is to simultaneously minimize the expected value and the variance of total flowtime, and the mean probability of tardiness. In cases where processing times follow normal distributions, a method using pairwise interchange of two jobs(PITJ) is proposed to generate a set of the approximate efficient schedules. The efficient schedules are not dominated by the criterion vectors of any other permutation schdules in the feasible region. Numerical experiments performed to ascertain the effectiveness of PITJ algorithm are also reported in the results.

Keywords

References

  1. Introduction to Sequencing and Scheduling Baker,K.R.
  2. Naval Research Logistics Quarterly v.23 Scheduling to Minimize the Weighted Sum of Completion Time with Secondary Criteria Burns,R.N.
  3. Naval Research Logistics Quarterly v.33 A Single-Machine Scheduling Problem with Random Processing Times Chakravarty,S.
  4. Theory of Scheduling Conway,R.W.;W.L.Maxwell;L.W.Miller
  5. Naval Research Logistics Quarterly v.22 One Machine Sequencing to Minimize Mean Flow Time with Minimum Number Tardy Emmons,H.
  6. Naval Research Logistics Quarterly v.22 A Note on Scheduling Problem with Dual Criteria Emmons,H.
  7. Squencing and Scheduling--A Introduction to the Mathematics of the Job -Shop-- French,S.
  8. Naval Research Logisitics Quarterly v.19 A Note on the Extension of a Result on Scheduling with Secondary Criteria Heck,H.;S.Roberts
  9. Bullentin of University of Osaka Prefecture, Series A v.40 no.2 Extension of Deterministic Scheduling to Stochastic Scheduling Jung,Y.S.;H.Nagasawa;N.Nishiyama
  10. Journal of Japan Industrial Management Association v.41 no.4 Bicriterion Single-Stage Scheduling to Minimize Both the Expected Value and the Variance of Total Flow Time ; Multiobjective Scheduling with Operational Time Distribution(PartⅠ) Jung,Y.S.;H.Nagasawa;N.Nishiyama
  11. Journal of Japan Industrial Management Association v.42 no.5 Three-objective Scheduling to Minimize the Expected Value and the Variance of Total Flow Time and Maximum Probability of Tardiness : Multiobjective Scheduling with Operational Time Distribution(Patr II.) Jung,Y.S.;H.Nagasawa;N.Nishiyama
  12. Management Science v.32 Scheduling with Multiple Performance Measures ; The One-Machine Case Nelson,R.T.;R.K.Sarin;R.L.Daniels
  13. Operations Research v.30 Minimizing the Expected Makespan in Stochastic Flow Shops Pinedo,M.
  14. IIE Transactions v.15 A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem Sen,T.;S.K.Gupta
  15. Management Science v.34 A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flow Time and Range of Lateness Sen,T.;F.M.Raiszadeh;P.Dileepan
  16. Naval Research Logistics Quqrterly v.3 Various Optimizers for Single-stage Production Smith,W.E.
  17. European Journal of Operational Research v.4 Solving a Bicriterion Scheduling Problem Van Wassenhove,L.N.;L.F.Gelders