IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v64y2013i1p147-156.html
   My bibliography  Save this article

Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions

Author

Listed:
  • C-C Wu

    (Feng Chia University, Taichung, Taiwan)

  • Y Yin

    (East China Institute of Technology, Jiangxi, China)

  • S-R Cheng

    (Cheng Shiu University, Kaohsiung County, Taiwan)

Abstract

Scheduling with learning effects has received growing attention nowadays. A well-known learning model is called ‘position-based learning’ in which the actual processing time of a job is a non-increasing function of its position to be processed. However, the actual processing time of a given job drops to zero precipitously as the number of jobs increases. Motivated by this observation, we propose two truncated learning models in single-machine scheduling problems and two-machine flowshop scheduling problems with ordered job processing times, respectively, where the actual processing time of a job is a function of its position and a control parameter. Under the proposed learning models, we show that some scheduling problems can be solved in polynomial time. In addition, we further analyse the worst-case error bounds for the problems to minimize the total weighted completion time, discounted total weighted completion time and maximum lateness.

Suggested Citation

  • C-C Wu & Y Yin & S-R Cheng, 2013. "Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(1), pages 147-156, January.
    • Handle: RePEc:pal:jorsoc:v:64:y:2013:i:1:p:147-156
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v64/n1/pdf/jors201246a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v64/n1/full/jors201246a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Zhongyi Jiang & Fangfang Chen & Xiandong Zhang, 2022. "Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 116-139, January.
    2. 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.
    3. Bai, Danyu & Tang, Mengqian & Zhang, Zhi-Hai & Santibanez-Gonzalez, Ernesto DR, 2018. "Flow shop learning effect scheduling problem with release dates," Omega, Elsevier, vol. 78(C), pages 21-38.
    4. Cheng, Bayi & Zhu, Huijun & Li, Kai & Li, Yongjun, 2019. "Optimization of batch operations with a truncated batch-position-based learning effect," Omega, Elsevier, vol. 85(C), pages 134-143.
    5. Jian-You Xu & Win-Chin Lin & Yu-Wei Chang & Yu-Hsiang Chung & Juin-Han Chen & Chin-Chia Wu, 2023. "A Two-Machine Learning Date Flow-Shop Scheduling Problem with Heuristics and Population-Based GA to Minimize the Makespan," Mathematics, MDPI, vol. 11(19), pages 1-21, September.
    6. Baoyu Liao & Xingming Wang & Xing Zhu & Shanlin Yang & Panos M. Pardalos, 2020. "Less is more approach for competing groups scheduling with different learning effects," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 33-54, January.
    7. Wenjuan Fan & Jun Pei & Xinbao Liu & Panos M. Pardalos & Min Kong, 2018. "Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning," Journal of Global Optimization, Springer, vol. 71(1), pages 147-163, May.

    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:pal:jorsoc:v:64:y:2013:i:1:p:147-156. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.