Comparing heuristic and evolutionary approaches for minimising the number of tardy jobs and maximum earliness on a single machine Online publication date: Sat, 30-Aug-2014
by Alexandros S. Xanthopoulos; Dimitrios E. Koulouriotis
International Journal of Multicriteria Decision Making (IJMCDM), Vol. 2, No. 2, 2012
Abstract: The bi-criterion problem of minimising the number of tardy jobs and maximum earliness on a single machine is investigated experimentally. Two approximate solution approaches are tested. The first one is based on transforming the bi-criterion problem into a series of single-objective sub-problems and then applying a deterministic, heuristic procedure to solve them iteratively. The second approach is based on a multi-objective evolutionary algorithm with random keys encoding scheme. A dataset of 180 problem instances with 50, 100, and 150 jobs was generated randomly in order to evaluate the performance of the two approaches. The Pareto optimal sets computed by the evolutionary approach were consistently under-populated when compared to those of the heuristic however; more than 60% of the solutions found by the heuristic in all instances were dominated by solutions generated by the evolutionary algorithm.
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 Multicriteria Decision Making (IJMCDM):
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