We study a make-to-order manufacturing system consisting of several processing centers that are subject to failures and repairs. Our objective is to build a model that can be used as a tool for negotiating the delivery date and the price of a certain upcoming order. The model takes into account...

In this paper, we propose a new method for partitioning a graph into an unspecified number of Hamiltonian subgraphs with minimum and maximum size requirements on the subgraphs. We refer to this problem as the cardinality constrained covering traveling salesman problem (CCC-TSP). Special cases of...