 Comparing heuristic and evolutionary approaches for minimising the number of tardy jobs and maximum earliness on a single machineAlexandros S. Xanthopoulos and Dimitrios E. Koulouriotis International Journal of Multicriteria Decision Making, 2012, vol. 2, issue 2, 178-188 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. Keywords: single machine scheduling; heuristics; tardy jobs; multi-objective evolutionary algorithms; maximum earliness; random keys encoding. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmcdm:v:2:y:2012:i:2:p:178-188 Access Statistics for this article More articles in International Journal of Multicriteria Decision Making from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.