We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
We studied a supplier selection problem, where a buyer, while facing random demand, is to decide ordering quantities from a set of suppliers with different yields and prices.We pr...
Disruptions in trips can prevent vehicles from executing their schedules as planned. Mechanical failures, accidents, and traffic congestion often hinder a vehicle schedule. When a...
Jing-Quan Li, Denis Borenstein, Pitu B. Mirchandan...
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The obje...
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...
Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lo...
The decision of whether to manufacture products within the US, manufacture internationally or to outsource production depends critically upon a thorough understanding of the costs...
Joseph C. Hartman, Stephen L. Liedtka, Lawrence V....
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...