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

Solution Algorithms for Single-Machine Group Scheduling with Learning Effect and Convex Resource Allocation

Author

Listed:
  • Wanlei Wang
  • Jian-Jun Wang
  • Ji-Bo Wang
  • Lei Xie

Abstract

This paper deals with a single-machine resource allocation scheduling problem with learning effect and group technology. Under slack due-date assignment, our objective is to determine the optimal sequence of jobs and groups, optimal due-date assignment, and optimal resource allocation such that the weighted sum of earliness and tardiness penalties, common flow allowances, and resource consumption cost is minimized. For three special cases, it is proved that the problem can be solved in polynomial time. To solve the general case of problem, the heuristic, tabu search, and branch-and-bound algorithms are proposed.

Suggested Citation

  • Wanlei Wang & Jian-Jun Wang & Ji-Bo Wang & Lei Xie, 2021. "Solution Algorithms for Single-Machine Group Scheduling with Learning Effect and Convex Resource Allocation," Complexity, Hindawi, vol. 2021, pages 1-13, March.
    • Handle: RePEc:hin:complx:6615824
    DOI: 10.1155/2021/6615824
    as

    Download full text from publisher

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

    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:6615824. 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.