IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6656261.html
   My bibliography  Save this article

Optimization for Due-Date Assignment Single-Machine Scheduling under Group Technology

Author

Listed:
  • Li-Yan Wang
  • Mengqi Liu
  • Ji-Bo Wang
  • Yuan-Yuan Lu
  • Wei-Wei Liu
  • Lei Xie

Abstract

In this paper, the single-machine scheduling problem is studied by simultaneously considering due-date assignment and group technology (GT). The objective is to determine the optimal sequence of groups and jobs within groups and optimal due-date assignment to minimize the weighted sum of the absolute value in lateness and due-date assignment cost, where the weights are position dependent. For the common (CON) due-date assignment, slack (SLK) due-date assignment, and different (DIF) due-date assignment, an On  log  n time algorithm is proposed, respectively, to solve the problem, where n is the number of jobs.

Suggested Citation

  • Li-Yan Wang & Mengqi Liu & Ji-Bo Wang & Yuan-Yuan Lu & Wei-Wei Liu & Lei Xie, 2021. "Optimization for Due-Date Assignment Single-Machine Scheduling under Group Technology," Complexity, Hindawi, vol. 2021, pages 1-9, March.
    • Handle: RePEc:hin:complx:6656261
    DOI: 10.1155/2021/6656261
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6656261.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/complexity/2021/6656261.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2021/6656261?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
    ---><---

    Citations

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


    Cited by:

    1. Ying Chen & Xiaole Ma & Guiqing Zhang & Yongxi Cheng, 2023. "On optimal due date assignment without restriction and resource allocation in group technology scheduling," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-19, March.

    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:hin:complx:6656261. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.