Skip to main content
Top

2012 | OriginalPaper | Chapter

A Heuristic toward Minimizing Waiting Time of Critical Jobs in a Flow Shop

Authors : R. Pugazhenthi, M. Anthony Xavior

Published in: Emerging Trends in Science, Engineering and Technology

Publisher: Springer India

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This paper deals with scheduling in permutation flow shop that is considered with the objective of minimizing the waiting time of priority based or critical jobs. Generally, priority based jobs are few in nature in all the flow shops. Hence, it is utmost important that we minimize the waiting time of critical or priority based jobs. All the existing heuristics are developed to minimize parameters like makespan time, flow time, etc. While processing jobs through machines, all machines are considered equally important. In this work, an attempt is made to improve the existing utilization of one or more jobs during processing. The above aim was achieved by reducing the waiting time of the critical or priority based jobs under consideration, and hence achieving zero waiting time for the same. The heuristic is proposed to improve the utilization of such critical jobs. The proposed heuristic was compared with the results of CDS method and validated.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Johnson SM, Balas E, Zawack D (1988) The shifting bottleneck procedure for the job shop scheduling. Manage Sci 34(3):391–401CrossRef Johnson SM, Balas E, Zawack D (1988) The shifting bottleneck procedure for the job shop scheduling. Manage Sci 34(3):391–401CrossRef
2.
go back to reference Ignal S, Schrage, Lominick P (1965) Priority dispatching and job lateness in a job shop. J Ind Eng 6:228–237 Ignal S, Schrage, Lominick P (1965) Priority dispatching and job lateness in a job shop. J Ind Eng 6:228–237
3.
go back to reference Pan QK, Wang L (2012) Effective heuristics for the blocking flow shop scheduling problem with makespan Minimization. OMEGA 40(2):218–229CrossRef Pan QK, Wang L (2012) Effective heuristics for the blocking flow shop scheduling problem with makespan Minimization. OMEGA 40(2):218–229CrossRef
4.
go back to reference Palmer DS (1965) Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum. Oper Res 16:101–107CrossRef Palmer DS (1965) Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum. Oper Res 16:101–107CrossRef
5.
go back to reference Campell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n job m machine sequencing problem. Manage Sci 16:630–637 Campell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n job m machine sequencing problem. Manage Sci 16:630–637
6.
go back to reference Dannenbring DG (1977) An evolution of flow shop sequencing heuristics. Manage Sci 23:1174–1182MATHCrossRef Dannenbring DG (1977) An evolution of flow shop sequencing heuristics. Manage Sci 23:1174–1182MATHCrossRef
7.
go back to reference King JR, Spachis AS (1980) Heuristics for flow shop scheduling. Int J Prod Res 18(3):345–357CrossRef King JR, Spachis AS (1980) Heuristics for flow shop scheduling. Int J Prod Res 18(3):345–357CrossRef
8.
go back to reference Stinson, Simith DT, Hogg GL (1982) A state of art survey of dispatching rules for manufacturing job shop operations. Int J Prod Res 20:27–45CrossRef Stinson, Simith DT, Hogg GL (1982) A state of art survey of dispatching rules for manufacturing job shop operations. Int J Prod Res 20:27–45CrossRef
10.
go back to reference Nawaz M, Ensocore E Jr, Ham I (1983) A heuristic algorithm for the m- machine, n- job, flow-shop sequencing problem, OMEGA. Int J Manage Sci 11(1):91–95 Nawaz M, Ensocore E Jr, Ham I (1983) A heuristic algorithm for the m- machine, n- job, flow-shop sequencing problem, OMEGA. Int J Manage Sci 11(1):91–95
11.
go back to reference Hundal TS, Rajgopal J (1988) An extension of Palmer heuristic for the flow shop scheduling problem. Int J Prod Res 26:1119–1124CrossRef Hundal TS, Rajgopal J (1988) An extension of Palmer heuristic for the flow shop scheduling problem. Int J Prod Res 26:1119–1124CrossRef
12.
go back to reference Winder R, Hertz (1989) A survey of priority based scheduling. OR Spectr 11:3–16 Winder R, Hertz (1989) A survey of priority based scheduling. OR Spectr 11:3–16
13.
go back to reference Osmon IH, Potts CN (1989) A state of art survey of static scheduling research involving due dates. Omega 12:63–76 Osmon IH, Potts CN (1989) A state of art survey of static scheduling research involving due dates. Omega 12:63–76
14.
go back to reference Ogbu FA, Smith DK (1990) Simulated annealing for the permutation flow shop problem. OMEGA 19(1):64–67CrossRef Ogbu FA, Smith DK (1990) Simulated annealing for the permutation flow shop problem. OMEGA 19(1):64–67CrossRef
Metadata
Title
A Heuristic toward Minimizing Waiting Time of Critical Jobs in a Flow Shop
Authors
R. Pugazhenthi
M. Anthony Xavior
Copyright Year
2012
Publisher
Springer India
DOI
https://doi.org/10.1007/978-81-322-1007-8_31

Premium Partners