State-of-the-art in optimisation and heuristics to solve manufacturing scheduling problem Online publication date: Wed, 13-Jul-2022
by Puja Bharti; Sushma Jain
International Journal of Operational Research (IJOR), Vol. 44, No. 3, 2022
Abstract: Manufacturing scheduling is known to be one of the most complex optimisation problems and falls in the category of NP-hard problems. Continuous efforts have been made by the researchers in the past to find convincingly accurate solutions for the instances in a reasonable time. It is valuable to compile the abundant literature available in this area for better understanding as well as convenience. This survey presents a systematic review of the optimisation approaches to solve manufacturing scheduling problem. Primarily, the research published during the period 2001-March 2019 has been considered. For this, a total of 456 research papers were examined. A comprehensive, well-informed examination and realistic analysis of the available literature provides an insight into major developments that has taken place pertaining to the use of heuristics/meta-heuristics in solving this problem. A classification based on objectives, optimisation techniques, benchmark instances, software tools, etc., highlights the research trends in this field along with future directions.
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 Operational Research (IJOR):
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