Program for stream Scheduling: Theory and applications

MB-20: Realistic production scheduling
Stream: Scheduling: Theory and applications
Room: 2103
Chair(s): Rubén Ruiz, Imma Ribas

• Improved iterated greedy procedures for the distributed permutation flowshop problem
  Rubén Ruiz, Quan-Ke Pan, Bahman Naderi
• A metaheuristic algorithm for the unrelated parallel machine scheduling problem with additional resources
  Eva Vallada, Fulgencia Villa, Luis Fanjul Peyró
• Approaching scheduling with automatic algorithm design
  Pedro Alfaro-Fernandez, Rubén Ruiz, Federico Pagnozzi, Thomas Stützle
• Simulation-optimization scheme for solving a real case of a ready mixed concrete dispatching problem
  Cristian E. Cortes, Mauricio Cerda, Zdenko Koscina, Pablo A. Rey

MD-20: Scheduling with resource constraints
Stream: Scheduling: Theory and applications
Room: 2103
Chair(s): Jose M Framinan

• Order scheduling with tardiness objective: Approximate solutions
  Jose M Framinan, Paz Perez Gonzalez, Victor Fernandez-Viagas
• Scheduling problems minimizing makespan with periodic maintenance
  Paz Perez Gonzalez, Jose M Framinan, Victor Fernandez-Viagas
• A population-based constructive heuristic for the permutation flowshop scheduling problem
  Victor Fernandez-Viagas, Paz Perez Gonzalez, Jose M Framinan
• Approximation algorithms for machine scheduling problems with non-renewable resource constraints
  Tamas Kis, Péter Györgyi

ME-20: Multiplicity of scheduling problems: New and updated applications
Stream: Scheduling: Theory and applications
Room: 2103
Chair(s): Socorro Rangel, Hélio Fuchigami

• A math-heuristic algorithm for a new parallel scheduling problem
  Edson Senne
• Design of an easy-to-use computer tool for university timetabling
  Jose Antonio Marmolejo, Jonas Velasco
• A computational study of MILP models for weighted just-in-time flow shop scheduling problem
  Hélio Fuchigami, Socorro Rangel

HA-26: New scheduling models and algorithms
Stream: Scheduling: Theory and applications
Room: 302A
Chair(s): Debora Ronconi

• Three-stage MILP planning model to support the transport scheduling of light oil derivatives in a pipeline network
  Guilherme Schnirmann, Suelen N. B. Magatão, Flávio Neves-Jr, Lucas Bueno, William Hitoshi Tsunoda Meira, Leandro Magatão, Lucia Valéria Arruda
• A tire curing scheduling problem
  Hector Cancela, Agustín Ghioldi, Sofía Lemes, Pedro Piñeyro, Joaquín Velázquez
• A new network flow model for the minimization of tool switches problem
  Horacio Yanasse, Tiago Silva, Antonio Chaves
• A biased random key genetic algorithm for the hybrid flowshop scheduling problem
  Debora Ronconi, Guilherme Mainieri