Scheduling of step-improving jobs with an identical improving rate

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 31
  • Download : 0
Job processing times change over time in real-life production and manufacturing systems due to various factors including machine or worker learning, machine deterioration, production system upgrades or technological shocks. For step-improving processing times, job processing times are reduced by a certain rate if they start to process at, or after, a common critical date, which has wide applicability in real-world settings, such as data gathering networks and production systems with part-time workers. This paper considers single machine scheduling of minimizing total weighted completion time with step-improving jobs. The problem is shown to be intractable. Both exact and heuristic algorithms are developed, and the approximability of the heuristic algorithm is shown for a special case of the problem. Finally, computational experiments show that the proposed algorithms provide very effective and efficient solutions.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
2022-05
Language
English
Article Type
Article
Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.73, no.5, pp.1127 - 1136

ISSN
0160-5682
DOI
10.1080/01605682.2021.1886616
URI
http://hdl.handle.net/10203/296597
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0