Single-machine scheduling with the learning effect of processing time and the deterioration effect of delivery time for prefabricated components

Na Li (), Ran Ma () and Yuzhong Zhang ()
Additional contact information
Na Li: Qingdao University of Technology
Ran Ma: Qingdao University of Technology
Yuzhong Zhang: Qufu Normal University

Journal of Combinatorial Optimization, 2025, vol. 49, issue 3, No 2, 26 pages

Abstract: Abstract In the production scheduling of prefabricated components, a scheduling model considering the learning effect of processing time and the deterioration effect of delivery time in this paper is provided. More precisely, it asks for an assignment of a series of independent prefabricated jobs that arrived over time to a single machine for processing, and once the execution of a job is finished, it will be transported to the destination. The information of each prefabricated job including its basic processing time $$b_{j}$$ b j , release time $$r_j$$ r j , and deterioration rate $$e_j$$ e j of delivery time is unknown in advance and is revealed upon the arrival of this job. Moreover, the actual processing time of prefabricated job $$J_j$$ J j with learning effect is $$p_{j}=b_{j}(a-b t)$$ p j = b j ( a - b t ) , where a and b are non-negative parameters and t denotes the starting time of prefabricated job $$J_j$$ J j , respectively. And the delivery time of prefabricated job $$J_j$$ J j is $$q_{j}=e_{j}C_{j}$$ q j = e j C j . The goal of scheduling is to minimize the maximum time by which all jobs have been delivered. For the problem, we first analyze offline optimal scheduling and then propose an online algorithm with a competitive ratio of $$2-bb_{\min }$$ 2 - b b min . Furthermore, the effectiveness of the online algorithm is demonstrated by numerical experiments and managerial insights are derived.

Keywords: Scheduling; Online algorithm; Single machine; Learning effect; Prefabricated components (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01271-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:3:d:10.1007_s10878-025-01271-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01271-w

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().