Loading...

Bicriteria two-machine flowshop scheduling using metaheuristics

Mansouri, S. A ; Sharif University of Technology | 2007

275 Viewed
  1. Type of Document: Article
  2. DOI: 10.1145/1276958.1277139
  3. Publisher: 2007
  4. Abstract:
  5. A bicriteria two-machine flowshop scheduling problem is addressed to minimize the number of setups and makespan. The jobs have sequence dependent setup times. Scheduling problems considering either of these objectives are NP-hard. Two multi-objective metaheurisctics based on genetic algorithms (MOGA) and simulated annealing (MOSA) are proposed to find approximations of Pareto-optimal frontiers. The performances of these approaches are compared with lower bounds for small problems. In larger problems, their performance is compared with each other. Experimentations revealed that both algorithms perform very similar on small problems and that MOGA outperforms MOSA in terms of the quality of solutions on larger problems
  6. Keywords:
  7. Genetic algorithms ; Heuristic algorithms ; Metadata ; Pareto principle ; Simulated annealing ; Flowshop ; Multicriteria scheduling ; Pareto-optimal frontiers ; Sequence-dependent setups ; Scheduling algorithms
  8. Source: 9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007, London, 7 July 2007 through 11 July 2007 ; 2007 , Pages 909- ; 9781595936974 (ISBN)
  9. URL: https://dl.acm.org/doi/abs/10.1145/1276958.1277139