Optimization a new mathematical model of hybrid flow shop work order problem by the Genetic Algorithm

  • Authors

    • Nasser Shahsavari Pour Science and Research branch,Islamic Azad University, Kerman,Iran
    • Hamed Asadi Science and Research branch,Islamic Azad University, Kerman,Iran
    • Mansoor Kheradmand Science and Research branch,Islamic Azad University, Kerman,Iran
    https://doi.org/10.14419/ijet.v1i3.147

    Received date: June 23, 2012

    Accepted date: June 24, 2012

    Published date: July 6, 2012

  • Abstract

    In competitive business, one of the challenges of management in industrial units is reducing the prime cost. Hybrid flow shop is one of the common production environments which lead to a significant decrease in production costs if it has a good and appropriate scheduling in production. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task Processing. In this paper we study the hybrid flow shop work order problems. A brief enumeration of the essential constraints that characterize this kind of organization is given. Problem is minimizing the production and inventory cost in Hybrid flow-shop organization. To solve problem we used the genetic algorithm to obtain the minimum of production cost. An illustrative example explains in detail the feature of the proposed model.

  • References

    1. J. N. D. Gupta, Two-stage hybrid flow shop scheduling problem,Journal of the Operational Research Society, 39(4) (1988),359–364.
    2. M. R. Garey and D. S. Johnson, A guide to the theory of NP Completeness,San Francisco (1979).
    3. J. N. D. Gupta and E. A. Tunc,Scheduling a two-stage hybrid flowshop with separable setup and removal times. European Journal of Operational Research, 77(3) (1994),415–428.
    4. J. N. D. Gupta and E. A.Tunc,Schedules for a two-stage hybrid flowshop with parallel machines at the second stage,International Journal of Production Research, 29(7) (1991),1489–1502.
    5. J. N. D. Gupta,Two-stage, hybrid flow shop scheduling problem. Journal of the Operational Research Society, 39(4) (1988),359–364.
    6. K. Alaykýran, O. Engin, A. Döyen,Using ant colony optimization to solve hybrid flow shop scheduling problems,The international journal of advanced manufacturing technology,35 (2007), 541–550.
    7. M. Jenabi, S. M. T. Fatemi-Ghomi, S. A. Torabi, B. Karimi,Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel processors, Applied Mathematics and Computation; 186(1) (2007),230–45.
    8. B. Akrami, B. Karimi, SM. Moattar-Hosseini,Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers the finite horizon case, Applied Mathematics and Computation,183 (2006),634–45.
    9. N. G. Hall, C. Srisk and arajah,A survey of machine scheduling problems with blocking and no-wait in process, Operations Research 44 (1996), 510–25.
    10. M. S. Salvador,A solution to a special case of flow shop scheduling problems, in Symposium of the Theory of Scheduling and Applications, S.E. Elmaghraby (ed.), New York, Springer, 1973.
    11. C. Rajendran, D. Chaudhuri,Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan,International Journal of Production Economics 27 (1992)., 137–143.
    12. S. A. Brah, J. L. Hunsucker.(1991).Branch and bound algorithm for the flow shop with multiple processors. European Journal of Operational Research 51, 88–99.
    13. T. Sawik,A scheduling algorithm for flexible flow lines with limited intermediate buffers,Journal of Manufacturing Systems, 9 (1993), 127–38.
    14. T. Sawik,Scheduling flexible flow lines with no-process buffers,International Journal of Production Research, 33 (1995),1359–70.
    15. T. Sawik,Mixed integer programming for scheduling surfacemount technology lines,International Journal of Production Research,39(1) (2001),3219–35.
    16. F. Riane, A. Artiba, S. Iassinovski,An integrated production planning and scheduling system for hybrid flowshop organizations, J. Production Economics 74 (2001), 33-48
    17. M.R. Garey, D.S. Johnson, R. Sethi,The complexity of flowshop and job shop scheduling, Mathematics of Operations Research ,1 (1976),117-129.
    18. Holland JH,Adaptation in natural and artificial systems, University of Michigan Press, 1975.

  • Downloads

  • How to Cite

    Pour, N. S., Asadi, H., & Kheradmand, M. (2012). Optimization a new mathematical model of hybrid flow shop work order problem by the Genetic Algorithm. International Journal of Engineering and Technology, 1(3), 192-204. https://doi.org/10.14419/ijet.v1i3.147