Scheduling with a weight-modifying activity to minimize the total weighted completion time
Bertrand M.T. Lin,
Shu-Wei Liu and
Gur Mosheiov
Omega, 2024, vol. 128, issue C
Abstract:
This paper considers a single-machine scheduling problem to minimize the total weighted completion time with a weight modifying activity, after which the job weights are discounted by a given factor. The problem is known to be ordinary NP-hard. We propose two mixed integer linear programs (MILPs) and a dynamic programming algorithm to optimally solve the problem. Optimality properties are established and then formulated as pruning constraints to improve the problem-solving efficiency of the MILPs. Special cases are discussed and shown to be solvable by polynomial time algorithms. Complexity status of the studied problem with several instance characteristics is shown. Computational experiments indicate that the optimality properties can reduce the computing efforts and that one of the proposed MILPs can solve instances of 200 jobs in a few seconds.
Keywords: Single-machine scheduling; Weight modifying activity; Mixed integer linear programming; Dynamic programming (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048324000811
Full text for ScienceDirect subscribers only
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:eee:jomega:v:128:y:2024:i:c:s0305048324000811
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01
DOI: 10.1016/j.omega.2024.103115
Access Statistics for this article
Omega is currently edited by B. Lev
More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().