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

On two single machine scheduling problems with fuzzy processing times and fuzzy due dates

Author

Listed:
  • Chanas, Stefan
  • Kasperski, Adam

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:147:y:2003:i:2:p:281-296
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00561-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. 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.
    2. E. L. Lawler, 1973. "Optimal Sequencing of a Single Machine Subject to Precedence Constraints," Management Science, INFORMS, vol. 19(5), pages 544-546, January.
    3. 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.
    4. 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. 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.
    2. Fridman, Ilia & Pesch, Erwin & Shafransky, Yakov, 2020. "Minimizing maximum cost for a single machine under uncertainty of processing times," European Journal of Operational Research, Elsevier, vol. 286(2), pages 444-457.
    3. J. Behnamian, 2016. "Survey on fuzzy shop scheduling," Fuzzy Optimization and Decision Making, Springer, vol. 15(3), pages 331-366, September.
    4. Wong, Bo K. & Lai, Vincent S., 2011. "A survey of the application of fuzzy set theory in production and operations management: 1998-2009," International Journal of Production Economics, Elsevier, vol. 129(1), pages 157-168, January.

    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. 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.
    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. J. Behnamian, 2016. "Survey on fuzzy shop scheduling," Fuzzy Optimization and Decision Making, Springer, vol. 15(3), pages 331-366, September.
    4. Ramachandra, Girish & Elmaghraby, Salah E., 2006. "Sequencing precedence-related jobs on two machines to minimize the weighted completion time," International Journal of Production Economics, Elsevier, vol. 100(1), pages 44-58, March.
    5. Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
    6. Reha Uzsoy & Chung‐Yee Lee & Louis A. Martin‐Vega, 1992. "Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 369-388, April.
    7. Adam Kasperski & Paweł Zieliński, 2019. "Risk-averse single machine scheduling: complexity and approximation," Journal of Scheduling, Springer, vol. 22(5), pages 567-580, October.
    8. Sakawa, Masatoshi & Kubota, Ryo, 2000. "Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms," European Journal of Operational Research, Elsevier, vol. 120(2), pages 393-407, January.
    9. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    10. Zhichao Geng & Jiayu Liu, 0. "Single machine batch scheduling with two non-disjoint agents and splitable jobs," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-22.
    11. 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.
    12. Fridman, Ilia & Pesch, Erwin & Shafransky, Yakov, 2020. "Minimizing maximum cost for a single machine under uncertainty of processing times," European Journal of Operational Research, Elsevier, vol. 286(2), pages 444-457.
    13. Zhang, Liqi & Lu, Lingfa & Yuan, Jinjiang, 2009. "Single machine scheduling with release dates and rejection," European Journal of Operational Research, Elsevier, vol. 198(3), pages 975-978, November.
    14. P. Detti & D. Pacciarelli, 2001. "A branch and bound algorithm for the minimum storage‐time sequencing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 313-331, June.
    15. Liqi Zhang & Lingfa Lu, 2016. "Parallel-machine scheduling with release dates and rejection," 4OR, Springer, vol. 14(2), pages 165-172, June.
    16. Allesandro Agnetis & Pitu B. Mirchandani & Dario Pacciarelli & Andrea Pacifici, 2004. "Scheduling Problems with Two Competing Agents," Operations Research, INFORMS, vol. 52(2), pages 229-242, April.
    17. Gur Mosheiov & Assaf Sarig, 2023. "A note on lot scheduling on a single machine to minimize maximum weighted tardiness," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-11, July.
    18. Olivier Ploton & Vincent T’kindt, 2022. "Exponential-time algorithms for parallel machine scheduling problems," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3405-3418, December.
    19. Briskorn, Dirk & Davari, Morteza & Matuschke, Jannik, 2021. "Single-machine scheduling with an external resource," European Journal of Operational Research, Elsevier, vol. 293(2), pages 457-468.
    20. Mosheiov, Gur & Oron, Daniel & Shabtay, Dvir, 2021. "Minimizing total late work on a single machine with generalized due-dates," European Journal of Operational Research, Elsevier, vol. 293(3), pages 837-846.

    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:147:y:2003:i:2:p:281-296. 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.