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

Optimal fuzzy counterparts of scheduling rules

Author

Listed:
  • Ozelkan, Ertunga C.
  • Duckstein, Lucien

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:113:y:1999:i:3:p:593-609
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00445-1
    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. Kuroda, Mitsuru & Wang, Zeng, 1996. "Fuzzy job shop scheduling," International Journal of Production Economics, Elsevier, vol. 44(1-2), pages 45-51, June.
    2. Han, Sangsu & Ishii, Hiroaki & Fujii, Susumu, 1994. "One machine scheduling problem with fuzzy duedates," European Journal of Operational Research, Elsevier, vol. 79(1), pages 1-12, November.
    3. 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.
    4. Ishibuchi, Hisao & Yamamoto, Naohisa & Misaki, Shinta & Tanaka, Hideo, 1994. "Local search algorithms for flow shop scheduling with fuzzy due-dates," International Journal of Production Economics, Elsevier, vol. 33(1-3), pages 53-66, January.
    5. Adamopoulos, George I. & Pappis, Costas P., 1996. "A fuzzy-linguistic approach to a multi-criteria sequencing problem," European Journal of Operational Research, Elsevier, vol. 92(3), pages 628-636, August.
    6. Stanfield, Paul M. & King, Russell E. & Joines, Jeff A., 1996. "Scheduling arrivals to a production system in a fuzzy environment," European Journal of Operational Research, Elsevier, vol. 93(1), pages 75-87, August.
    7. McCahon, Cynthia S. & Lee, E. Stanley, 1992. "Fuzzy job sequencing for a flow shop," European Journal of Operational Research, Elsevier, vol. 62(3), pages 294-301, November.
    8. Ishii, Hiroaki & Tada, Minoru, 1995. "Single machine scheduling problem with fuzzy precedence relation," European Journal of Operational Research, Elsevier, vol. 87(2), pages 284-288, December.
    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. Yuri N. Sotskov & Natalja G. Egorova, 2019. "The Optimality Region for a Single-Machine Scheduling Problem with Bounded Durations of the Jobs and the Total Completion Time Objective," Mathematics, MDPI, vol. 7(5), pages 1-21, April.
    2. Chang, Zhiqi & Ding, Jian-Ya & Song, Shiji, 2019. "Distributionally robust scheduling on parallel machines under moment uncertainty," European Journal of Operational Research, Elsevier, vol. 272(3), pages 832-846.
    3. Yuri N. Sotskov & Natalja M. Matsveichuk & Vadzim D. Hatsura, 2020. "Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times," Mathematics, MDPI, vol. 8(8), pages 1-51, August.
    4. Chanas, Stefan & Kasperski, Adam, 2003. "On two single machine scheduling problems with fuzzy processing times and fuzzy due dates," European Journal of Operational Research, Elsevier, vol. 147(2), pages 281-296, June.

    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. J. Behnamian, 2016. "Survey on fuzzy shop scheduling," Fuzzy Optimization and Decision Making, Springer, vol. 15(3), pages 331-366, September.
    2. Sanja Petrovic & Carole Fayad & Dobrila Petrovic & Edmund Burke & Graham Kendall, 2008. "Fuzzy job shop scheduling with lot-sizing," Annals of Operations Research, Springer, vol. 159(1), pages 275-292, March.
    3. Dubois, Didier & Fargier, Helene & Fortemps, Philippe, 2003. "Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge," European Journal of Operational Research, Elsevier, vol. 147(2), pages 231-252, June.
    4. Stanfield, Paul M. & King, Russell E. & Joines, Jeff A., 1996. "Scheduling arrivals to a production system in a fuzzy environment," European Journal of Operational Research, Elsevier, vol. 93(1), pages 75-87, August.
    5. R Tavakkoli-Moghaddam & N Safaei & M M O Kah, 2008. "Accessing feasible space in a generalized job shop scheduling problem with the fuzzy processing times: a fuzzy-neural approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(4), pages 431-442, April.
    6. K A H Kobbacy & S Vadera & M H Rasmy, 2007. "AI and OR in management of operations: history and trends," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 10-28, January.
    7. Chanas, Stefan & Kasperski, Adam, 2003. "On two single machine scheduling problems with fuzzy processing times and fuzzy due dates," European Journal of Operational Research, Elsevier, vol. 147(2), pages 281-296, June.
    8. Anglani, Alfredo & Grieco, Antonio & Guerriero, Emanuela & Musmanno, Roberto, 2005. "Robust scheduling of parallel machines with sequence-dependent set-up costs," European Journal of Operational Research, Elsevier, vol. 161(3), pages 704-720, March.
    9. Allet, Samir, 2003. "Handling flexibility in a "generalised job shop" with a fuzzy approach," European Journal of Operational Research, Elsevier, vol. 147(2), pages 312-333, June.
    10. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. Ho, Johnny C., 1995. "Flowshop sequencing with mean flowtime objective," European Journal of Operational Research, Elsevier, vol. 81(3), pages 571-578, March.
    20. 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.

    More about this item

    Statistics

    Access and download statistics

    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:113:y:1999:i:3:p:593-609. 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.