MO-Greedy: An Extended Beam-Search Approach for Solving a Multi-criteria Scheduling Problem on Heterogeneous Machines

Optimization problems can often be tackled with respect to several objectives. In such cases, there can be several incomparable Pareto-optimal solutions. Computing or approximating such solutions is a major challenge in algorithm design. Here, we show how to use an extended beam-search technique to solve a multi-criteria scheduling problem for heterogeneous machines. This method, called MO-Greedy (for Multi-Objective greedy), allows the design of a multi-objective algorithm when a single-objective greedy one is known. We show that we can generate, in a single execution, a Pareto front optimized with respect to the preferences specified by the decision maker. We compare our approach to other heuristics and an approximation algorithm and show that the obtained front is, on average, better with our method.

[1]  Emmanuel Jeannot,et al.  Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments , 2010, IEEE Transactions on Parallel and Distributed Systems.

[2]  Mourad Hakem,et al.  Reliability and Scheduling on Systems Subject to Failures , 2007, 2007 International Conference on Parallel Processing (ICPP 2007).

[3]  Jose M. Framiñan,et al.  A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria , 2008, OR Spectr..

[4]  Lucas Bradstreet,et al.  A Fast Incremental Hypervolume Algorithm , 2008, IEEE Transactions on Evolutionary Computation.

[5]  P. McMullen,et al.  A beam search heuristic method for mixed-model scheduling with setups , 2005 .

[6]  Manoj Kumar Tiwari,et al.  New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs , 2010, Eur. J. Oper. Res..

[7]  Prabuddha De,et al.  Heuristic Estimation of the Efficient Frontier for a Bi‐Criteria Scheduling Problem , 1992 .

[8]  Roberta S. Russell,et al.  Using beam search techniques for sequencing mixed-model assembly lines , 1997, Ann. Oper. Res..

[9]  M. Azizoglu,et al.  Bicriteria scheduling problem involving total tardiness and total earliness penalties , 1991 .

[10]  Emmanuel Jeannot,et al.  Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems , 2007, SPAA '07.

[11]  Bruce T. Lowerre,et al.  The HARPY speech recognition system , 1976 .

[12]  Marco Laumanns,et al.  PISA: A Platform and Programming Language Independent Interface for Search Algorithms , 2003, EMO.

[13]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[14]  El-Ghazali Talbi,et al.  ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics , 2004, J. Heuristics.

[15]  Emmanuel Jeannot,et al.  Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines , 2008, Euro-Par.

[16]  Ming Zhong,et al.  Bicriteria train scheduling for high-speed passenger railroad planning applications , 2005, Eur. J. Oper. Res..

[17]  Salim Hariri,et al.  Task scheduling algorithms for heterogeneous processors , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[18]  Lothar Thiele,et al.  On Set-Based Multiobjective Optimization , 2010, IEEE Transactions on Evolutionary Computation.