LI Jinquan ZENG Wenyi WANG Qunzhi. A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time[J]. Journal of Beijing Normal University(Natural Science), 2017, 53(2): 127-132. DOI: 10.16360/j.cnki.jbnuns.2017.02.001
Citation: LI Jinquan ZENG Wenyi WANG Qunzhi. A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time[J]. Journal of Beijing Normal University(Natural Science), 2017, 53(2): 127-132. DOI: 10.16360/j.cnki.jbnuns.2017.02.001
shu

A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time

    Graphical Abstract
    • Abstract
  • A single machine due date assignment scheduling problem with asymmetric fuzzy processing is investigated, to minimize the total earliness and tardiness penalties, written as 
    Further, it is proven to be polynomially solvable when the processing times have the same width ratio. A numerical example is shown to illustrate that the proposed method is effective based on the due date assignment scheduling problems with historical data of processing time.
    • FullText(HTML)
  • loading
    • References (1)
    • Related Articles

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return
    Baidu
    map