Adriana C. Alvim

A hybrid bin-packing heuristic to multiprocessor scheduling

  • Adriana C. Alvim
  • Celso C. Ribeiro
    • Categories Meta Heuristics, Scheduling Tags , , ,

    The multiprocessor scheduling problem consists in scheduling a set of tasks with known processing times into a set of identical processors so as to minimize their makespan, i.e., the maximum processing time over all processors. We propose a new heuristic for solving the multiprocessor scheduling problem, based on a hybrid heuristic to the bin packing … Read more

    A hybrid improvement heuristic for the one-dimensional bin packing problem

  • Dario J. Aloise
  • Adriana C. Alvim
  • Fred Glover
  • Celso C. Ribeiro
    • Categories Combinatorial Optimization, Meta Heuristics Tags , , ,

    We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process … Read more