0000000000342295
AUTHOR
Panos M. Pardalos
Solving a continuous periodic review inventory-location allocation problem in vendor-buyer supply chain under uncertainty
In this work, a mixed-integer binary non-linear two-echelon inventory problem is formulated for a vendor-buyer supply chain network in which lead times are constant and the demands of buyers follow a normal distribution. In this formulation, the problem is a combination of an (r, Q) and periodic review policies based on which an order of size Q is placed by a buyer in each fixed period once his/her on hand inventory reaches the reorder point r in that period. The constraints are the vendors’ warehouse spaces, production restrictions, and total budget. The aim is to find the optimal order quantities of the buyers placed for each vendor in each period alongside the optimal placement of the ve…
Nurse Scheduling Problem: An Integer Programming Model with a Practical Application
We use a binary integer programming model to formulate and solve a nurse scheduling problem (NSP) which maximally satisfies nurse preferences. In a practical application of a VA hospital, besides considering the scheduling of two types of nurses (registered nurses and licensed practical nurses), two other types of employees (nursing assistants and health care techs), one nurse manager, and a clinical nurse leader are also included in our model. Most of these employees are working full-time. In addition, we distinguish the schedule of weekdays and weekends with different requirements and different preferences for employees. Besides the requirements for each shift, we consider requirements fo…