An adaptation of the galaxy-based search algorithm for solving the single machine total weighted tardiness problem Online publication date: Mon, 13-Dec-2021
by Mohamed Habib Zahmani
International Journal of Manufacturing Research (IJMR), Vol. 16, No. 4, 2021
Abstract: The single machine total weighted tardiness (SMTWT) problem (referred to as 1//ΣwiTi) requires a given set of jobs to be sequenced on a single machine while minimising the sum of weighted tardiness, where the tardiness of a job is zero if it is completed before its due date and is equal to completion time minus its due date otherwise. In this article, the 'galaxy-based search algorithm' (GbSA) is adapted to solve the SMTWT benchmark problems and its results are compared with the best-known reported solutions. The GbSA is a newly developed optimisation tool and is considered a metaheuristic technique inspired by the dynamics of galactic arm spirals. It is robust, capable of avoiding being trapped in a local optimum, has a relative fast convergence, and is easily implementable. The experiments results show that the proposed adaptation of the GbSA is effective and obtains high-quality solutions within reasonable computation times. [Submitted 4 March 2019; Accepted 26 February 2020]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Research (IJMR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook