Skip to main content
SpringerLink
Log in

Multicriteria dynamic scheduling by swapping of dispatching rules

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

For most shop floors, consideration of more than one criterion would be likely to provide more realistic scheduling of a given set of jobs. The present paper considers this aspect of scheduling and uses an algorithm proposed by the authors in their previous work for implementing several criteria simultaneously in a shop of dynamic nature. The algorithm considers several dispatching rules simultaneously for selecting a job for processing and continuously monitors the attained values of performance measures. The selection of dispatching rules is made by identifying the worst performing criterion. A rule that can improve system performance for the worst-performing criterion is selected to dispatch the part under consideration. In this paper, several case studies have been attempted to evaluate the efficiency of the algorithm. The results of the taken case studies indicate that in a dynamic system the system performance improves by changing the dispatching rules corresponding to the worst-performance criterion at the appropriate deterioration in the performance measures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Smith WE (1956) Various optimizers for single-stage production. Nav Res Logist Q 3(1):59–66

    Article  Google Scholar 

  2. Heck H, Roberts S (1972) A note on the extension of a result on scheduling with secondary criteria. Nav Res Logist Q 19:403–405

    Article  MATH  MathSciNet  Google Scholar 

  3. Sen T, Gupta SK (1983) A branch and bound to solve a bi-criteria scheduling problem. IIE Trans 15:84–88

    Article  Google Scholar 

  4. Miyazaki S (1981) One-machine scheduling problem with dual criteria. J Oper Res Soc Jpn 24(1):37–50

    MATH  MathSciNet  Google Scholar 

  5. Shanthikumar JG (1983) Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number tardy jobs. Comput Oper Res 10(3):255–266

    Article  MathSciNet  Google Scholar 

  6. Su LH, Chou FD (2001) Heuristic for scheduling in a bi-criteria single-machine problem. J Chin Inst Ind Eng 18(5):39–46

    Google Scholar 

  7. Koksalan M, Keha AB (2003) Using genetic algorithms for single-machine bicriteria scheduling problems. Eur J Oper Res 145(3):543–556

    Article  MathSciNet  Google Scholar 

  8. Kao EPC (1980) A multiple objective decisions theoretic approach to one-machine scheduling problems. Comp Oper Res 7(4):251–259

    Article  Google Scholar 

  9. Ignizio JP (1984) A generalized goal programming approach to the minimal interface, multicriteria, N×1 scheduling problem. IIE Trans 16(4):316–322

    Article  MathSciNet  Google Scholar 

  10. Daniel RM (1990) A multi-objective approach to resource allocation in scheduling. Eur J Oper Res 48(2):226–241

    Article  MathSciNet  Google Scholar 

  11. Norbis MI, Smith JM (1988) A multi-objective multi-level heuristics for dynamic resource constrained scheduling problems. Eur J Oper Res 33(1):30–41

    Article  MATH  MathSciNet  Google Scholar 

  12. Rajendran C (1992) Two-stage flow shop scheduling problems with bi-criteria. J Oper Res Soc 43(9):871–884

    Article  MATH  Google Scholar 

  13. Lio C-J, Yu W-C, Joe C-B (1997) Bi-criterion scheduling in the two-machine flowshop. J Oper Res Soc 48(9):929–935

    Google Scholar 

  14. Gupta JND, Ho Jc, Webster S (2000) Bi-criteria optimization of the make span and mean flow time on two identical parallel machines. J Oper Res Soc 51(11):1330–1339

    Article  MATH  Google Scholar 

  15. Ho JC, Wong JS (1979) Makespan minimization for parallel identical processors. Nav Res Logist 42:935–948

    Article  Google Scholar 

  16. Teghem J, Tuyttens D, Ulungu EL (2000) An interactive heuristic method for multi-objective combinatorial optimization. Comput Oper Res 27:621–634

    Article  MATH  Google Scholar 

  17. Loukil T, Teghem J, Tuyttens D (2005) Solving multi-objective production scheduling problems using metaheuristics. Eur J Oper Res 161(1):42–61

    Article  MATH  MathSciNet  Google Scholar 

  18. Allahverdi A, Aldowaisan T (2002) No-wait flow shop with bi-criteria of make span and total completion time. J Oper Res Soc 53(9):1004–1015

    Article  MATH  Google Scholar 

  19. Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 161(3):592–623

    Article  MathSciNet  Google Scholar 

  20. Liu J, MacCarthy BL (1996) The classification of FMS scheduling problems. Int J Prod Res 34(3):647–656

    Article  MATH  Google Scholar 

  21. Muhlemann AP, Lockett AG, Farn CK (1982) Job-shop scheduling heuristics and frequency of scheduling. Int J Prod Res 20(2):227–241

    Article  Google Scholar 

  22. Holthaus O (1999) Scheduling in job-shop with machine breakdowns: an experimental study. Comput Ind Eng 36(1):137–162

    Article  Google Scholar 

  23. Blackstone JH, Phillips DT, Hogg GL (1982) A state-of-the-art survey of dispatching rules for manufacturing job-shop operations. Int J Prod Res 20(1):27–45

    Article  Google Scholar 

  24. Singh A, Mehta NK, Jain PK (2004) A multi-criterion scheduling approach in a dynamic manufacturing environment. 15th International DAAAM Symposium -DAAAM 2004. Intelligent manufacturing & automation: globalizations- technology-men-nature. 3-6th November 2004, Vienna, Austria, pp 419–420

  25. Law AM, Kelton WD (2000) Simulation modeling and analysis, 3rd edn. McGraw-Hill, New York

    Google Scholar 

  26. Singh A, Mehta NK, Jain PK (2004) Performance analysis of flow-time-based dispatching rules with unreliable machines. Int J Sim Model 3(4):109–120

    Google Scholar 

  27. Jayamohan MS, Rajendran C (2000) New dispatching rules for shop scheduling: a step forward. Int J Prod Res 38(3):563–586

    Article  MATH  Google Scholar 

  28. Holthaus O, Rajendran C (1997) Efficient dispatching rules for scheduling in a job shop. Int J Prod Econ 48(1):87–105

    Article  Google Scholar 

  29. Singh A, Mehta NK, Jain PK (2005) Tardiness-based new dispatching rules for shop scheduling with unreliable machines. Int J Sim Modell 4(1):5–16

    Article  Google Scholar 

  30. Conway RW, Maxwell WL, Miller LW (1967) Theory of scheduling. Addition-Wesley Publishing Company

  31. Kanet JJ, Hayya JG (1981) Priority dispatching with operation due dates in a job shop. J Oper Manage 2(3):167–176

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical and Industrial Engineering, Indian Institute of Technology Roorkee, Roorkee, 247667, India

    Amol Singh, N. K. Mehta & P. K. Jain

Authors
  1. Amol Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. K. Mehta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. K. Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. K. Jain.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Singh, A., Mehta, N.K. & Jain, P.K. Multicriteria dynamic scheduling by swapping of dispatching rules. Int J Adv Manuf Technol 34, 988–1007 (2007). https://doi.org/10.1007/s00170-006-0674-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-006-0674-4

Keywords

Search

Navigation