Lower bounds to the graph partitioning problem through generalized linear programming and network flows
This paper studies the machine repair problem consisting of M operating machines with S spare machines, and R servers (repairmen) who leave for a vacation of random length when there are no failed machines queuing up for repair in the repair facility. At the end of the vacation the servers return to the repair facility and operate one of three vacation policies: single vacation, multiple vacation, and hybrid single/multiple vacation. The Markov process and the matrix-geometric approach are used...
The unrevealed failures of a system are detected only by inspection. In this work, an inspection policy along with a maintenance procedure for multiunit systems with dependent times to failure is presented. The existence of an optimum policy is also discussed.
This paper addresses the problem of managing a waiting list for elective surgery to decide the number of patients selected from the waiting list and to schedule them in accordance with the operating room capacity in the next period. The waiting list prioritizes patients not only by their initial urgency level but also by their waiting time. Selecting elective surgery patients requires a balance between the waiting time for urgent patients and that for less urgent patients. The problem is formulated...
The Progressive Second Price mechanism (PSP), recently introduced by Lazar and Semret to share an infinitely-divisible resource among users through pricing, has been shown to verify very interesting properties. Indeed, the incentive compatibility property of that scheme, and the convergence to an efficient resource allocation where established, using the framework of Game Theory. Therefore, that auction-based allocation and pricing scheme seems particularly well-suited to solve congestion problems...
While making informed decisions regarding investments in customer retention and acquisition becomes a pressing managerial issue, formal models and analysis, which may provide insight into this topic, are still scarce. In this study we examine two dynamic models for optimal acquisition and retention models of a monopoly, the total cost and the cost per customer models. These models are analytically analyzed using classical, direct, methods and asymptotic expansions (for the total cost model). In...
While making informed decisions regarding investments in customer retention and acquisition becomes a pressing managerial issue, formal models and analysis, which may provide insight into this topic, are still scarce. In this study we examine two dynamic models for optimal acquisition and retention models of a monopoly, the total cost and the cost per customer models. These models are analytically analyzed using classical, direct, methods and asymptotic expansions (for the total cost model). In...