-
作者：Clifford, JJ; Posner, ME
作者单位：CNA (The Center for Naval Analyses); University System of Ohio; Ohio State University
摘要：When a production shop has a large number of identical parts, the parts are often recorded by a part description and quantity. This differs from the type of description used by standard scheduling problems, which assume that all parts or jobs are unique. In high-multiplicity scheduling problems, identical jobs are encoded in an efficient format similar to that of the production shop. The input describes one of the jobs and the number of such identicaljobs. We consider single-machine, high-mult...
-
作者：Belenguer, JM; Martinez, MC; Mota, E
作者单位：University of Valencia
摘要：In this paper we consider the Split Delivery Vehicle Routing Problem (SDVRP), a relaxation of the known Capacitated Vehicle Routing Problem (CVRP) in which the demand of any client can be serviced by more than one vehicle. We define a feasible solution of this problem, and we show that the convex hull of the associated incidence vectors is a polyhedron (P-SDVRP), whose dimension depends on whether a vehicle visiting a client must service, or not at least one unit of the client demand. From a p...
-
作者：De Vericourt, F; Karaesmen, F; Dallery, Y
作者单位：Sorbonne Universite; Centre National de la Recherche Scientifique (CNRS); Universite Paris Saclay
摘要：We consider the problem of dynamically allocating production capacity between two products to minimize the average inventory and backorder costs per unit time in a make-to-stock single machine system. Using sample path comparisons and dynamic programming, we give a characterization of the optimal hedging point policy for a certain region of the state space. The characterization is simple enough to lead to easily implementable heuristics and provides a formal justification of some of the earlie...
