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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Johnson SM, Balas E, Zawack D (1988) The shifting bottleneck procedure for the job shop scheduling. Manage Sci 34(3):391–401
Ignal S, Schrage, Lominick P (1965) Priority dispatching and job lateness in a job shop. J Ind Eng 6:228–237
Pan QK, Wang L (2012) Effective heuristics for the blocking flow shop scheduling problem with makespan Minimization. OMEGA 40(2):218–229
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–107
Campell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n job m machine sequencing problem. Manage Sci 16:630–637
Dannenbring DG (1977) An evolution of flow shop sequencing heuristics. Manage Sci 23:1174–1182
King JR, Spachis AS (1980) Heuristics for flow shop scheduling. Int J Prod Res 18(3):345–357
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–45
Palmer K (1984) Sequencing rules and due date assignments in a job shop. Manage Sci 30(9):1093–1104
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
Hundal TS, Rajgopal J (1988) An extension of Palmer heuristic for the flow shop scheduling problem. Int J Prod Res 26:1119–1124
Winder R, Hertz (1989) A survey of priority based scheduling. OR Spectr 11:3–16
Osmon IH, Potts CN (1989) A state of art survey of static scheduling research involving due dates. Omega 12:63–76
Ogbu FA, Smith DK (1990) Simulated annealing for the permutation flow shop problem. OMEGA 19(1):64–67
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer India
About this paper
Cite this paper
Pugazhenthi, R., Anthony Xavior, M. (2012). A Heuristic toward Minimizing Waiting Time of Critical Jobs in a Flow Shop. In: Sathiyamoorthy, S., Caroline, B., Jayanthi, J. (eds) Emerging Trends in Science, Engineering and Technology. Lecture Notes in Mechanical Engineering. Springer, India. https://doi.org/10.1007/978-81-322-1007-8_31
Download citation
DOI: https://doi.org/10.1007/978-81-322-1007-8_31
Published:
Publisher Name: Springer, India
Print ISBN: 978-81-322-1006-1
Online ISBN: 978-81-322-1007-8
eBook Packages: EngineeringEngineering (R0)