Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time

Xinyu Sun, Xin-Na Geng and Feng Liu

Journal of the Operational Research Society, 2021, vol. 72, issue 12, 2674-2689

Abstract: This article considers the flow shop problem of minimising the total weighted completion time in which the processing times of jobs are variable according to general position weighted learning effects. Two simple heuristics are proposed, and their worst-case error bounds are analysed. In addition, some complex heuristics (including simulated annealing algorithms) and a branch-and-bound algorithm are proposed as solutions to this problem. Finally, computational experiments are performed to examine the effectiveness and efficiency of the proposed algorithms.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2020.1806746 (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:72:y:2021:i:12:p:2674-2689

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

DOI: 10.1080/01605682.2020.1806746

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 ().