IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v53y2015i9p2707-2717.html
   My bibliography  Save this article

Single machine parallel-batching scheduling problem with fuzzy due-date and fuzzy precedence relation

Author

Listed:
  • Xuesong Li
  • Hiroaki Ishii
  • Minghao Chen

Abstract

A problem of single machine parallel-batching problem with fuzzy due-date and fuzzy precedence relation is investigated. Each job has a positive processing time. Set-up times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. The length of a batch is equal to the largest processing time among all jobs in the batch. Fuzzy due-date denotes the degree of satisfaction with respect to completion times of jobs. Fuzzy precedence constraint expresses the satisfaction level about precedence between two jobs. The objective is to minimise maximum completion time, maximise the minimum value of desirability of the fuzzy due-date and the minimum value of desirability of the fuzzy precedence. First, we propose a fuzzy due-date and ordinary precedence model, which maximises the minimum satisfaction degree of fuzzy due-date. An efficient iterative algorithm based on Procedure HL is designed. On that basis, another efficient algorithm to seek non-dominated solution is presented for the main problem in this paper. The non-dominated solution is defined to be consists of batch size, batch number and allocation of jobs to batches. The whole solution procedure needs at most O(n4logn)$ O({n^4}\log n) $ computational time. Finally, we illustrate the procedure with a numerical example.

Suggested Citation

  • Xuesong Li & Hiroaki Ishii & Minghao Chen, 2015. "Single machine parallel-batching scheduling problem with fuzzy due-date and fuzzy precedence relation," International Journal of Production Research, Taylor & Francis Journals, vol. 53(9), pages 2707-2717, May.
    • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:9:p:2707-2717
    DOI: 10.1080/00207543.2014.975866
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.975866
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2014.975866?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    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:taf:tprsxx:v:53:y:2015:i:9:p:2707-2717. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.