Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs

Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2012.

Bibliographic Details
Main Author: Telha Cornejo, Claudio (Claudio A.)
Other Authors: Andreas S. Schulz.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2012
Subjects:
Operations Research Center.
Online Access:http://hdl.handle.net/1721.1/70446

Similar Items

Similar Items