IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v31y2014i05ns0217595914500365.html
   My bibliography  Save this article

Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times

Author

Listed:
  • Ji-Bo Wang

    (School of Science, Shenyang Aerospace University, Shenyang 110136, P. R. China;
    State Key Laboratory for Manufacturing Systems Engineering, (Xi'an Jiaotong University), Xi'an 710053, P. R. China)

  • Ming-Zheng Wang

    (School of Management Science and Engineering, Dalian University of Technology, Dalian 116024, P. R. China)

Abstract

We consider a single-machine common due-window assignment scheduling problem, in which the processing time of a job is a function of its position in a sequence and its resource allocation. The window location and size, along with the associated job schedule that minimizes a certain cost function, are to be determined. This function is made up of costs associated with the window location, window size, earliness, and tardiness. For two different processing time functions, we provide a polynomial time algorithm to find the optimal job sequence and resource allocation, respectively.

Suggested Citation

  • Ji-Bo Wang & Ming-Zheng Wang, 2014. "Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(05), pages 1-15.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:05:n:s0217595914500365
    DOI: 10.1142/S0217595914500365
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595914500365
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595914500365?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.

    Citations

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


    Cited by:

    1. Wu, Yu-Bin & Wan, Long & Wang, Xiao-Yuan, 2015. "Study on due-window assignment scheduling based on common flow allowance," International Journal of Production Economics, Elsevier, vol. 165(C), pages 155-157.
    2. Shang-Chia Liu, 2015. "Common Due-Window Assignment and Group Scheduling with Position-Dependent Processing Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-19, December.
    3. Xinyu Sun & Xin-Na Geng & Tao Liu, 2020. "Due-window assignment scheduling in the proportionate flow shop setting," Annals of Operations Research, Springer, vol. 292(1), pages 113-131, September.
    4. Hongyu He & Mengqi Liu & Ji-Bo Wang, 2017. "Resource constrained scheduling with general truncated job-dependent learning effect," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 626-644, February.
    5. Zhusong Liu & Zhenyou Wang & Yuan-Yuan Lu, 2017. "A Bicriteria Approach for Single Machine Scheduling with Resource Allocation, Learning Effect and a Deteriorating Maintenance Activity," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(04), pages 1-16, August.
    6. Lin-Hui Sun & Kai Cui & Ju-hong Chen & Jun Wang, 2016. "Due date assignment and convex resource allocation scheduling with variable job processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3551-3560, June.

    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:wsi:apjorx:v:31:y:2014:i:05:n:s0217595914500365. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.