Wikanda Phaphan
ABSTRACT
The paper addresses an n-job, m-machinery permutation flow shop scheduling problem with minimization of the total flow time objective. We present a new modified version of the heuristic of Woo and Yim and the heuristic of Laha and Sarin, named "WYLS heuristic". Extensive computational experimentation were conducted to examine the performance of the proposed heuristic. Statistically significant represents the LS, proposed, FL, WY and NEH heuristics have equivalent performance, while Gupta's heuristic is the least effective.
- Rajendran, C. and Chaudhuri, D. 1991. An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research. 61, 318--325.Google Scholar
Cross Ref
- Rajendran, C. 1993. Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics. 29, 65--73, 1993.Google ScholarCross Ref
- Rajendran, C. and Ziegler, H. 1997. An efficient heuristic for scheduling in a flow shop to minimize total weighted flowtime of jobs. European Journal of Operational Research. 103, 38--129.Google ScholarCross Ref
- Woo, H. S. and Yim, D. S. 1998. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers and Operations Research. 25, 3, 82--175.Google ScholarDigital Library
- Framinan, J. M. and Leisten, R. 2003. An efficient constructive heuristic for flowtime minimization in permutation flow shops. Omega. 31, 311--317.Google ScholarCross Ref
- Liu, J. and Reeves, C. R. 2001. Constructive and composite heuristics solution of the P || Σ Ci scheduling problem. European Journal of Operational Research. 132, 52--439.Google ScholarCross Ref
- Kalczynski, P. J. and Kamburowski, J. 2007. On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega. 35, 53--60.Google ScholarCross Ref
- Kalir, A. A. and Sarin, S. C. 2001. A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots. Omega. 29, 84--577.Google ScholarCross Ref
- Sarin, S. and Lefoka, M. 1993. Scheduling heuristic for the n-job, mmachine flow shop. Omega. 21, 34--229.Google ScholarCross Ref
- Osman, I. H. and Potts, C. N. 1989. Simulated annealing for permutation flow-shop scheduling. Omega. 17, 7--551.Google ScholarCross Ref
- Rad, S. F. Ruiz, R. and Baroojerdian, N. 2009. New high performing heuristics for minimizing makespan in permutation flowshops. Omega. 37, 2 (April 2009), 331--345.Google ScholarCross Ref
- Nawaz, M. Enscore, E. and Ham, I. 1983. A heuristic algorithm or the m machine, n-job flow shop sequencing problem. Omega. 11, 91--95.Google ScholarCross Ref
- Palmer, D. S. 1965. Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Operational Research Quarterly. 16, 101--107.Google ScholarCross Ref
- Gupta, J. N. D. 1971. A functional Heuristic Algorithm for the flow shop scheduling problem. Operation Research Quarterly. 22, 39--47.Google ScholarCross Ref
- Campbell, H. G. Dudek, R. A. and Smith, M. L. 1970. A heuristic algorithm for n jobs m machines sequencing problem. Management Science. 16, 630--637.Google ScholarDigital Library
- Laha, D. and Sarin, S. C. 2009. A heuristic to minimize total flowtime in permutation flowshop. Omega. 37, 734--739.Google ScholarCross Ref
- Karg, R. and Thompson, G. 1964. A heuristic approach to solving travelling salesman problems. Management Science, 10, 225--248.Google ScholarDigital Library
- Johnson, S. 1954. Optimal two- and three-stage production schedules with set up times included. Naval Research Logistics Quarterly. 1, 61--68.Google ScholarCross Ref
- Taillard, E. 1993. Benchmarks for basic scheduling problems. European Journal of Operational Research. 64, 278--285.Google ScholarCross Ref
- Vallada, E. Ruiz, R. Framinan, J. M. 2015. New hard benchmark for flowshop scheduling problems minimising makespan. European Journal of Operational Research. 240, 666--677.Google ScholarCross Ref
Index Terms
- A New Hybrid Heuristic for Minimizing Total Flow Time in Permutation Flow Shop
Recommendations
Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization
Two efficient constructive heuristics for the Fm|block|Ci are proposed.We show that the insertion phase of heuristic NEH can worsen the solution.The structure of each constructive method is used in a GRASP combined with VNS.The computational evaluation ...
New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
This paper develops a set of new simple constructive heuristic algorithms to minimize total flow-time for an n -jobs m -machines permutation flowshop scheduling problem. We first propose a new iterative algorithm based on the best existing simple ...
Efficient heuristic for solving non-permutation flow-shop scheduling problems with maximal and minimal time lags
Infeasibility of non-permutation schedules in m-machine problem.Display Omitted Clarified the conditions for feasibility and dominance for non-PFSP.Developed 5 efficient neighbourhood searching heuristics.Proposed the best performed PFSP algorithm and ...
Comments