IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v192y2009i2p460-467.html
   My bibliography  Save this article

Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions

Author

Listed:
  • Allouche, Mohamed Anis
  • Aouni, Belaïd
  • Martel, Jean-Marc
  • Loukil, Taïcir
  • Rebaï, Abdelwaheb

Abstract

The multi-criteria scheduling problem is one of the main research subjects in the field of multiple objectives programming. Several procedures have been developed to deal with this type of problem where some conflicting criteria have to be optimized simultaneously. The aim of our paper is to propose an aggregation procedure that integrates three different criteria to find the best sequence in a flow shop production environment. The compromise programming model and the concept of satisfaction functions will be utilized to integrate explicitly the manager's preferences according to the deviations between the achievement and the aspiration levels of the following criteria: Makespan, total flow time and total tardiness.

Suggested Citation

  • Allouche, Mohamed Anis & Aouni, Belaïd & Martel, Jean-Marc & Loukil, Taïcir & Rebaï, Abdelwaheb, 2009. "Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions," European Journal of Operational Research, Elsevier, vol. 192(2), pages 460-467, January.
    • Handle: RePEc:eee:ejores:v:192:y:2009:i:2:p:460-467
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00997-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Herbert G. Campbell & Richard A. Dudek & Milton L. Smith, 1970. "A Heuristic Algorithm for the n Job, m Machine Sequencing Problem," Management Science, INFORMS, vol. 16(10), pages 630-637, June.
    2. Muhittin Oral & Ossama Kettani, 1992. "A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems," Operations Research, INFORMS, vol. 40(1-supplem), pages 109-116, February.
    3. Gupta, Jatinder N. D. & Neppalli, Venkata R. & Werner, Frank, 2001. "Minimizing total flow time in a two-machine flowshop problem with minimum makespan," International Journal of Production Economics, Elsevier, vol. 69(3), pages 323-338, February.
    4. Van Wassenhove, Luc N. & Gelders, Ludo F., 1980. "Solving a bicriterion scheduling problem," European Journal of Operational Research, Elsevier, vol. 4(1), pages 42-48, January.
    5. Loukil, T. & Teghem, J. & Tuyttens, D., 2005. "Solving multi-objective production scheduling problems using metaheuristics," European Journal of Operational Research, Elsevier, vol. 161(1), pages 42-61, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Erol, Ismail & Oztel, Ahmet & Searcy, Cory & Medeni, İ. Tolga, 2023. "Selecting the most suitable blockchain platform: A case study on the healthcare industry using a novel rough MCDM framework," Technological Forecasting and Social Change, Elsevier, vol. 186(PA).
    2. Yenisey, Mehmet Mutlu & Yagmahan, Betul, 2014. "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends," Omega, Elsevier, vol. 45(C), pages 119-135.
    3. Büsing, Christina & Goetzmann, Kai-Simon & Matuschke, Jannik & Stiller, Sebastian, 2017. "Reference points and approximation algorithms in multicriteria discrete optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 829-840.
    4. Raja Jayaraman & Cinzia Colapinto & Danilo Liuzzi & Davide Torre, 2017. "Planning sustainable development through a scenario-based stochastic goal programming model," Operational Research, Springer, vol. 17(3), pages 789-805, October.
    5. Irfan Ali & Umar Muhammad Modibbo & Jahangir Chauhan & Maryam Meraj, 2021. "An integrated multi-objective optimization modelling for sustainable development goals of India," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 23(3), pages 3811-3831, March.
    6. Mohamed Anis Allouche, 2010. "Manager’s Preferences Modeling within Multi-Criteria Flowshop Scheduling Problem: A Metaheuristic Approach," International Journal of Business Research and Management (IJBRM), Computer Science Journals (CSC Journals), vol. 1(2), pages 33-45, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    2. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    3. Yenisey, Mehmet Mutlu & Yagmahan, Betul, 2014. "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends," Omega, Elsevier, vol. 45(C), pages 119-135.
    4. Toktas, Berkin & Azizoglu, Meral & Koksalan, Suna Kondakci, 2004. "Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan," European Journal of Operational Research, Elsevier, vol. 157(2), pages 286-295, September.
    5. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    6. Solimanpur, M. & Vrat, Prem & Shankar, Ravi, 2004. "A heuristic to minimize makespan of cell scheduling problem," International Journal of Production Economics, Elsevier, vol. 88(3), pages 231-241, April.
    7. Barry B. & Quim Castellà & Angel A. & Helena Ramalhinho Lourenco & Manuel Mateo, 2012. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
    8. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    9. Vo[ss], Stefan & Witt, Andreas, 2007. "Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application," International Journal of Production Economics, Elsevier, vol. 105(2), pages 445-458, February.
    10. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    11. Vineet Jain & Tilak Raj, 2018. "An adaptive neuro-fuzzy inference system for makespan estimation of flexible manufacturing system assembly shop: a case study," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(6), pages 1302-1314, December.
    12. Allahverdi, Ali, 2003. "The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime," European Journal of Operational Research, Elsevier, vol. 147(2), pages 373-396, June.
    13. Crama, Y. & Pascual J., R. & Torres, A., 2004. "Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes," European Journal of Operational Research, Elsevier, vol. 159(2), pages 364-378, December.
    14. Framinan, J. M. & Leisten, R., 2003. "An efficient constructive heuristic for flowtime minimisation in permutation flow shops," Omega, Elsevier, vol. 31(4), pages 311-317, August.
    15. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On the NEH heuristic for minimizing the makespan in permutation flow shops," Omega, Elsevier, vol. 35(1), pages 53-60, February.
    16. Dhaenens-Flipo, Clarisse, 2001. "A bicriterion approach to deal with a constrained single-objective problem," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 93-101, December.
    17. Ozelkan, Ertunga C. & Duckstein, Lucien, 1999. "Optimal fuzzy counterparts of scheduling rules," European Journal of Operational Research, Elsevier, vol. 113(3), pages 593-609, March.
    18. Ho, Johnny C., 1995. "Flowshop sequencing with mean flowtime objective," European Journal of Operational Research, Elsevier, vol. 81(3), pages 571-578, March.
    19. Matin, Hossein N.Z. & Salmasi, Nasser & Shahvari, Omid, 2017. "Makespan minimization in flowshop batch processing problem with different batch compositions on machines," International Journal of Production Economics, Elsevier, vol. 193(C), pages 832-844.
    20. Schaller, Jeffrey E. & Gupta, Jatinder N. D. & Vakharia, Asoo J., 2000. "Scheduling a flowline manufacturing cell with sequence dependent family setup times," European Journal of Operational Research, Elsevier, vol. 125(2), pages 324-339, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:192:y:2009:i:2:p:460-467. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.