Abstract
A three-machine flow shop scheduling problem of minimum makespan is addressed in this paper. The setup time and transportation time are considered as independent parameters of processing. Further, setup time, processing time and transportation time are considered to be stochastic rather than deterministic. It is observed that the actual value of these cannot be estimated in advance unless the processing of jobs is completed on each of the available machines and only prior information of lower and upper bounds is available. Since the exact value of the time required is not known in advance, there may not exist a unique optimal schedule of jobs. Therefore, it is desired to obtain the set of all dominating schedules and reduce the cardinality of solution set. To meet the claimed objective, the local and global dominance relations have been developed and the use of these relations is represented by numerical illustration.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
S. Aggarwal, A. Gautam, D.K. Chauhan, L.M. Tiwari, S. Kapoor, A flow shop scheduling problem with transportation time and separated setup time of jobs. Procedia Eng. 38, 1327–1332 (2012)
A. Allahverdi, The third comprehensive survey on scheduling problems with setup times/costs. Eur. J. Oper. Res. 246, 345–378 (2015)
A. Allahverdi, Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times. Decis. Mak. Manuf. Serv. 1(1–2), 5–23 (2017)
A. Allahverdi, F. Al-Anzi, A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times. Eur. J. Oper. Res. 169, 767–780 (2006)
A. Allahverdi, Y.N. Sotskov, Two machine flowshop minimum length scheduling problem with random and bounded processing times. Int. Trans. Oper. Res. 10, 65–76 (2003)
P.C. Bagga, K. Khurana, Two-machine flowshop with separated sequence-independent setup times: mean completion time criterion. Indian J. Manag. Syst. 2, 47–57 (1986)
A.B. Chandramauli, Heuristic approach for n-job 3 machine flow shop scheduling problem involving transportation time, breakdown and weights of jobs. Math. Comput. Appl. 10(2), 301–305 (2005)
X. Dong, H. Huang, P. Chen, An improved NEH-based heuristic for permutation flow shop problem. Comput. Oper. Res. 35, 3962–3968 (2008)
R. Gangadharan, C. Rajendran, A simulated annealing heuristic for scheduling in a flowshop with bicriteria. Comput. Ind. Eng. 27, 473–476 (1994)
M.R. Garey, J.R. Johnson, R. Sethi, The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117–129 (1986)
D. Gupta, S. Sharma, S. Sharma, Heuristic approach for n-jobs, 3-machines flow shop scheduling problem, processing time associated with probabilities involving transportation time, break-down interval, weightage of jobs and job block criteria. Math. Theory Model. 1(1), 30–36 (2011)
S.M. Johnson, Optimal two and three stage production schedules with setup time included. Naval Res. Log. Q. 1, 69–81 (1954)
P.J. Kalczynski, J. Kamburowski, An improved NEH heuristic to minimize makespan in permutation flow shops. Comput. Oper. Res. 35, 3001–3008 (2009)
W. Liu, Y. Jin, M. Price, A new improved NEH heuristic for permutation flowshop scheduling problems. Int. J. Product. Econ. 193, 21–30 (2017)
P.L. Maggu, G. Das, Elements of Advanced Production Scheduling (UPPD, New Delhi, 1980)
A. Mittal, S. Agarwal, S. Prasad, S.R. Ansari, Heuristic approach for n jobs, 3 machines flow shop scheduling problem involving transportation time, equivalent job block, weight of jobs and break down internval. Int. J. Appl. Math. Appl. 3(1), 77–84 (2011)
M. Nawaz, E.E. Enscore, I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega. 11(1), 91–95 (1983)
C. Rajendran, H. Ziegler, Ant colony algorithms for permutation flow shop scheduling to minimize makespan/ total flowtime of jobs. Eur. j. op. Res. 155(2), 426–438 (2004)
R. Ruiz, T. Stutzle. An iterated greedy algorithm for permutation flow shop scheduling problem. Eur. J. Oper. Res. 177(3), 2033-2049 (2007)
Y.N. Sotskov, A. Allahverdi, T.C. Lai, Flowshop scheduling problem to minimize total completion time with random and bounded processing times. J. Oper. Res. Soc. 55, 277–286 (2004)
L. Wang, D.Z. Zheng, An effective hybrid heuristic for flow shop scheduling. Int. J. Adv. Manuf. Tech. 21, 38–44 (2003)
K.C. Ying, S.-W. Lin, A high-performing constructive heuristic for minimizing makespan in permutation flowshops. Int. J. Product. Ind. Eng. 36(6), 355–362 (2014)
Acknowledgements
One of authors (Meenakshi Sharma) acknowledges the financial support provided by council of scientific and industrial research, New Delhi, India, in the form of SRF through grant number 09/135(0766)/2017-EMR-I.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Sharma, M., Sharma, M., Sharma, S., Kumar, A. (2020). Flow Shop Scheduling Problem of Minimizing Makespan with Bounded Processing Parameters. In: Nagar, A., Deep, K., Bansal, J., Das, K. (eds) Soft Computing for Problem Solving 2019 . Advances in Intelligent Systems and Computing, vol 1138. Springer, Singapore. https://doi.org/10.1007/978-981-15-3290-0_14
Download citation
DOI: https://doi.org/10.1007/978-981-15-3290-0_14
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-3289-4
Online ISBN: 978-981-15-3290-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)