Christos D. Tarantilis

Improved Branch-and-Cut for the Inventory Routing Problem Based on a Two-Commodity Flow Formulation

  • Eleftherios G. Manousakis
  • Panagiotis P. Repoussis
  • Christos D. Tarantilis
  • Emmanouil Zachariadis
    • Categories Branch and Cut Algorithms, Supply Chain Management

    This paper examines the Inventory Routing Problem (IRP) with Maximum Level inventory policy. The IRP is a broad class of hard to solve problems with numerous practical applications in the field of freight transportation and logistics. A supplier is responsible for determining the timing and the quantity of replenishment services offered to a set of … Read more

    Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs

  • Gregory A. Kasapidis
  • Dimitris C. Paraskevopoulos
  • Panagiotis P. Repoussis
  • Christos D. Tarantilis
    • Categories Meta Heuristics, Scheduling Tags , , , ,

    A common assumption in the shop scheduling literature is that the processing order of the operations of each job is sequential; however, in practice there can be multiple connections and finish-to-start dependencies among the operations of each job. This paper studies flexible job shop scheduling problems with arbitrary precedence graphs. Rigorous mixed integer and constraint … Read more