Preview

An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria

Powerful Essays
Open Document
Open Document
6346 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
International Journal of Industrial Engineering & Production Research
December 2012, Volume 23, Number 4

pp. 301-308
ISSN: 2008-4889

http://IJIEPR.iust.ac.ir/

An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
D. Khorasanian & G. Moslehi*
Danial Khorasanian is an M.S. Student of Department of Industrial Engineering, Isfahan University of Technology, Isfahan, Iran Ghasem Moslehi is a Professor of Department of Industrial Engineering, Isfahan University of Technology, Isfahan, Iran

KEYWORDS
Constructive heuristic, Iterated greedy algorithm, Blocking flow shop, Total flow time

ABSTRACT
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is tested on the Taillard 's instances. Computational results show the high efficiency of this algorithm with comparison state-of-the-art algorithms. We report new best solutions for 88 instances of 120 Taillard 's instances.
© 2012 IUST Publication, IJIEPR, Vol. 23, No. 4, All Rights Reserved.

1. Introduction
The flow shop scheduling problem is one of the most popular machine scheduling problems with extensive engineering relevance, representing nearly a quarter of manufacturing systems, assembly lines and information service facilities in use nowadays [1]. In the general flow shop model, it is assumed that the buffers have unlimited capacity. However, in many real flow shop environments, the buffers may have limited capacity due to technological requirements or process characteristics [2]. A special case of these environments is the flow shop with zero capacity buffers that the related problem is known as the



References: [1] Wang, L., Pan, Q.K., Suganthan, P.N., Wang, W.H., & Wang, Y.M., "A Novel Hybrid Discrete Differential Evolution Algorithm for Blocking Flow Shop Scheduling Problems", Computers and Operations Research, Vol. 37, 2010, pp. 509-520. [2] Hall, N.G., Sriskandarajah, C., "A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process", Operations Research, Vol. 44, 1996, pp. 510525. [3] Grabowski, J., Pempera, J., "The Permutation Flow Shop Problem with Blocking. A Tabu Search Approach", Omega, Vol. 35, 2007, pp. 302-311. [4] Grabowski, J., Pempera, J., "Sequencing of Jobs in Some Production System", European Journal of Operational Research, Vol. 125, 2000, pp. 535-550. [5] Rock, H., "Some New Results in Flow Shop Scheduling", Zeitschrift fur Operations Research, Vol. 28, 1984, pp. 116. [6] McCormick, S.T., Pinedo, M.L., Shenker, S., Wolf, B., "Sequencing in an Assembly Line with Blocking to Minimize Cycle Time", Operations Research, Vol. 37, 1989, pp. 925-935. [7] Ronconi, D.P., "A Note on Constructive Heuristics for the Flow Shop Problem with Blocking", International Journal of Production Economics, Vol. 87, 2004, pp. 39-48. International Journal of Industrial Engineering & Production Research, December 2012, Vol. 23, No. 4 D. Khorasanian & G. Moslehi An Iterated Greedy Algorithm for Solving the Blocking Flow Shop… 308 [8] Companys, R., Mateo, M., "Different Behaviour of a Double Branch-and-Bound Algorithm on Fm|Prmu|Cmax and Fm|Block|Cmax Problems", Computers and Operations Research, Vol. 34, 2007, pp. 938-953. [9] Wang, L., Pan, Q.K., Tasgetiren, M.F., "Minimizing the Total Flow Time in a Flow Shop with Blocking by using Hybrid Harmony Search Algorithms", Expert Systems with Applications, Vol. 37, 2010, pp. 7929-7936. [10] Nawaz, M., Enscore Jr, E.E., Ham, I., "A Heuristic Algorithm for the m-Machine, n-Job Flow-Shop Sequencing Problem", Omega, Vol. 11, 1983, pp. 91-95. [11] Caraffa, V., Ianes, S., Bagchi, T.P., Sriskandarajah, C., "Minimizing Makespan in a Blocking Flow Shop using Genetic Algorithms", International Journal of Production Economics, Vol. 70, 2001, pp. 101-115. [12] Ribas, I., Companys, R., Tort-Martorell, X., "An Iterated Greedy Algorithm for the Flow Shop Scheduling Problem with Blocking", Omega, Vol. 39, 2011, pp. 293-301. [13] Wang, L., Pan, Q.K., Tasgetiren, M.F., "A Hybrid Harmony Search Algorithm for the Blocking Permutation Flow Shop Scheduling Problem", Computers & Industrial Engineering, Vol. 61, 2011, pp. 76-83. [14] Ruiz, R., & Stutzle, T., "A Simple and Efective Iterated Greedy Algorithm for the Permutation Flow Shop Scheduling Problem", European Journal of Operational Research, Vol. 177, 2007, pp. 2033-2049. [15] Ronconi, D.P., Henriques, L.R.S., "Some Heuristic Algorithms for Total Tardiness Minimization in a Flowshop with Blocking", Omega, Vol. 37, 2009, pp. 272-281. [16] Framinan, J.M., Leisten, R., "An Eficient Constructive Heuristic for Flowtime Minimisation in Permutation Flow Shops", Omega, Vol. 31, 2003, pp. 311-317. [17] Kalczynski, P.J., Kamburowski, J., "An Improved NEH Heuristic to Minimize Makespan in Permutation Flow Shops", Computers and Operations Research, Vol. 35, 2008, pp. 3001-3008. [18] Taillard, E., "Benchmarks for Basic Scheduling Problems", European Journal of Operational Research, Vol. 64, 1993, pp. 278-285. International Journal of Industrial Engineering & Production Research, December 2012, Vol. 23, No. 4

You May Also Find These Documents Helpful

  • Satisfactory Essays

    M1 Week 3

    • 1315 Words
    • 6 Pages

    Step 4: If the smallest processing time is on the second machine, assign that job at the end of the sequence and eliminate the job.…

    • 1315 Words
    • 6 Pages
    Satisfactory Essays
  • Good Essays

    The problem basically consists of finding the optimum set of routes that represent the lowest possible total cost and/or total travel time. The plant is dealing with the repositioning of trucks to serve its supply demand and determining a number of transportation units that optimally balance supply requirements against the cost of maintaining the transportation units. In order to increase truck utilization and achieve better performance, the plant has to adequately and efficiently ensure the scheduling of a steady supply of hogs.…

    • 1274 Words
    • 6 Pages
    Good Essays
  • Good Essays

    Annotated Bibilography

    • 648 Words
    • 3 Pages

    In this article the authors discuss some of the most important and significant steps that production control needs to follow when it comes to scheduling in cellular manufacturing. The authors point out that it’s important to have a clear understanding of the part number families in order to balance out the cell with the machines and man power needed to run the cell efficiency. They point out that running in a batch mode helps control the work in process and achieve a desirable flow through the cell. They go on to say that scheduling the cell is complex and it’s important that the cell layout is such that the cell can maintain the level of work in process.…

    • 648 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Soares, M & Vieira, G. A new multi-objective optimization method for master production scheduling based on genetic algorithm. (June 2009). International Journal of Advanced Manufacturing Technology, 41(5/6). Retrieved January 4, 2014 from EBSCOhost database.…

    • 1637 Words
    • 8 Pages
    Powerful Essays
  • Satisfactory Essays

    We did less messing around with the lot size and priority since these were definitely less important to the overall success of your factory than the number of machines you had. We did switch the lot size to 3 by 20 early in the simulation since we know that smaller batch sizes can speed up production. We were afraid to go to the 5 by 12 because of the large setup time at stations one. We ended up with a total of 6 machines at station one, which allowed two orders to be simultaneously worked on with a batch of 3 x 20.…

    • 501 Words
    • 3 Pages
    Satisfactory Essays
  • Better Essays

    Hi-Ho Yo-Yo, Inc

    • 1077 Words
    • 5 Pages

    References: Hochbaum, D. S. (1999). The Scheduling Problems. Retrieved On October 20, 2011 from riot.ieor.berkeley.edu/riot/Applications/Scheduling/algorithms.html…

    • 1077 Words
    • 5 Pages
    Better Essays
  • Better Essays

    Functional Area

    • 825 Words
    • 4 Pages

    The ultimate goal for the company is to foster growth and expansion by becoming the foremost provider in quality products and customer service. In order to reach this goal and experience 100% growth over the next five years, the Production and Operations department (“Productions”) must streamline its manufacturing and restructure inventory processes. At present, the current facility operates at maximum capacity. Adding second and third shifts will enable the company to meet consumer demand and to provide the right product for the right price.…

    • 825 Words
    • 4 Pages
    Better Essays
  • Powerful Essays

    Goldratt, E., 1988, Computerized shop floor scheduling. International Journal of Production Research, 26 (3) 443-455.…

    • 11337 Words
    • 46 Pages
    Powerful Essays
  • Powerful Essays

    The objective of this course is to familiarize students with the major tools used for manufacturing planning and control. To this end, we will perform an in-depth analysis of integrated operations management systems with emphasis on operations planning and control, material requirements planning, master scheduling, forecasting, capacity planning, just-in-time and related topics. These tools will be covered with more detail than previous SCM courses and we will examine how the various components fit together to form a complete system.…

    • 2563 Words
    • 12 Pages
    Powerful Essays
  • Good Essays

    The processing at our plant consists of a number of sequential operations performed on different equipment. Different products require different times on each equipment. The demand for each product is market driven with significant random variation. This is creating scheduling problems with frequent idle capacities or backlogs on the various equipment. This is the major problem in meeting delivery targets. The DFSS should target the idle capacities or backlogs as defects and appropriate tools should be used to design production schedules. One option that can be considered is planning for average forecasted demands. The inventory carried over from lean periods can be kept aside for periods of sudden high demands. Another option can be to lower production levels during lean periods and outsource during periods of high demand. Careful evaluation of both options is required.…

    • 620 Words
    • 3 Pages
    Good Essays
  • Good Essays

    The first thing to consider is the process of cleaning and coating of the boards. This particular process involves the set-up of the machines, the loading of the boards, and the actual cleaning and coating of the said boards by the machines. From the computations above, it is clearly illustrated that there is a disparity between the loading of the boards into the machines and the output of the cleaning and the coating machines. The loading rate exceeds that of the cleaning and coating capacities. So the capacity of the flow process is at an imbalance. On the other hand, It appears that some of the stations may be run by an inefficient amount of operators.…

    • 655 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Luggers and Butchers

    • 5446 Words
    • 22 Pages

    Ohta, H. (2006). A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs. International journal of production economics, 101(1), 19-22.…

    • 5446 Words
    • 22 Pages
    Powerful Essays
  • Powerful Essays

    By submitting this thesis electronically, I declare that the entirety of the work contained therein is my own, original work, that I am the owner of the copyright thereof (unless to the extent explicitly otherwise stated) and that I have not previously in its entirety or in part submitted it for obtaining any qualification.…

    • 54990 Words
    • 220 Pages
    Powerful Essays
  • Satisfactory Essays

    The manual experience-based process planning is most widely used. It is mainly based on a manufacturing engineer's experience and knowledge of production facilities, equipment, their capabilities, processes, and tooling. The major problem with this approach is that it is time consuming and developed plans may not be consistent and optimum. The feasibility of developed process plan is dependant on many factors such as availability of machine tools, scheduling and machine allocation etc. Computer aided process planning is developed to overcome this problems to some…

    • 284 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Minimisation of the residual stress in the heat affected zones of AISI 304 plates was performed by means of several design of the…

    • 3449 Words
    • 14 Pages
    Powerful Essays

Related Topics