On scheduling of step-improving jobs to minimize the total weighted completion time

T.C.E. Cheng, Svetlana A. Kravchenko and Bertrand M.T. Lin

Journal of the Operational Research Society, 2024, vol. 75, issue 4, 720-730

Abstract: Kim et al. (2022) studied single-machine scheduling of step-improving jobs with a common discount factor to minimize the total weighted completion time. This study proposes a pseudo-polynomial algorithm to solve the problem. We then consider the general problem in which the discount factors are job dependent. It is proven that there is an optimal solution in which the early normal jobs are sequenced in the WSPT order and the late discounted jobs are sequenced in the WSPT order. Based on two WSPT lists, a dynamic programming solution algorithm is proposed. The run time is pseudo-polynomial when the distance of any job is bounded by a constant, where the distance of a job is the absolute difference of the two positions of this job in two WSPT-ordered job lists.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2023.2203150 (text/html)
Access to full text is restricted to subscribers.

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:taf:tjorxx:v:75:y:2024:i:4:p:720-730

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2023.2203150

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().