A Dynamic Programming Algorithm For Days-Off Scheduling With Sequence Dependent Labor Costs

This paper presents a dynamic programming (DP) algorithm for solving a labor scheduling problem with several realistic days-off scheduling constraints and a cost structure that depends on the work sequence for each employee. The days-off scheduling constraints include the following: (1) each employee is assigned no more than three workdays per week, (2) each employee is assigned at least two consecutive off days per week, and (3) any work stretch cannot exceed four consecutive workdays. The sequence-dependent cost structure assumes that the daily wage of each employee depends on two factors: (1) whether the given workday is weekend or a regular workday, and (2) the sequence of work patterns assigned in previous days. A DP algorithm suited to instances of moderate size is used to determine the optimum work assignments that minimize the total labor cost, while satisfying the work demand under the stated constraints

A Dynamic Programming Algorithm For Days-Off Scheduling With Sequence Dependent Labor Costs

This paper presents a dynamic programming (DP) algorithm for solving a labor scheduling problem with several realistic days-off scheduling constraints and a cost structure that depends on the work sequence for each employee. The days-off scheduling constraints include the following: (1) each employee is assigned no more than three workdays per week, (2) each employee is assigned at least two consecutive off days per week, and (3) any work stretch cannot exceed four consecutive workdays. The sequence-dependent cost structure assumes that the daily wage of each employee depends on two factors: (1) whether the given workday is weekend or a regular workday, and (2) the sequence of work patterns assigned in previous days. A DP algorithm suited to instances of moderate size is used to determine the optimum work assignments that minimize the total labor cost, while satisfying the work demand under the stated constraints

Integrating Quality And Maintenance Decisions In A Production- Inventory Model For Deteriorating Items

In typical production-inventory models of deteriorating items, deterioration of the production process has not been considered. In this paper, a model is proposed in which both the produced items and the production equipment deteriorate. When the production system deteriorates, it shifts to an out-of-control state and begins to produce a proportion of defective items, necessitating corrective maintenance action. A model is formulated to integrate several realistic aspects, including item and process deterioration, varying demand and production rates, quality, inspection, and maintenance. A heuristic solution algorithm is developed to determine the production and inspection schedules, and a numerical example is solved

Integrating Quality And Maintenance Decisions In A Production- Inventory Model For Deteriorating Items

In typical production-inventory models of deteriorating items, deterioration of the production process has not been considered. In this paper, a model is proposed in which both the produced items and the production equipment deteriorate. When the production system deteriorates, it shifts to an out-of-control state and begins to produce a proportion of defective items, necessitating corrective maintenance action. A model is formulated to integrate several realistic aspects, including item and process deterioration, varying demand and production rates, quality, inspection, and maintenance. A heuristic solution algorithm is developed to determine the production and inspection schedules, and a numerical example is solved

Workforce scheduling and routing problems: literature survey and computational study

In the context of workforce scheduling, there are many scenarios in which personnel must carry out tasks at different locations hence requiring some form of transportation. Examples of these type of scenarios include nurses visiting patients at home, technicians carrying out repairs at customers’ locations and security guards performing rounds at different premises, etc. We refer to these scenarios as workforce scheduling and routing problems (WSRP) as they usually involve the scheduling of personnel combined with some form of routing in order to ensure that employees arrive on time at the locations where tasks need to be performed. The first part of this paper presents a survey which attempts to identify the common features of WSRP scenarios and the solution methods applied when tackling these problems. The second part of the paper presents a study on the computational difficulty of solving these type of problems. For this, five data sets are gathered from the literature and some adaptations are made in order to incorporate the key features that our survey identifies as commonly arising in WSRP scenarios. The computational study provides an insight into the structure of the adapted test instances, an insight into the effect that problem features have when solving the instances using mathematical programming, and some benchmark computation times using the Gurobi solver running on a standard personal computer

A mixed-data evaluation in group TOPSIS with differentiated decision power

[[abstract]]This main objective of this paper is to provide decision support for mixed data in group Technique for Order Preference by Similarity to Idea Solution (TOPSIS) with differentiated decision power. We use a signum function to compare the ordinal performance of alternatives on any qualitative criterion, or the partial information provided by decision makers. The proposed process for ordinal information is uniformly coherent with the traditional TOPSIS steps, preserving the characteristic of distance-based utilities. Ordinal weights are also considered herein, and the decision power of the group members is formulated by their weights under an agreement in the group. Two examples demonstrate that the proposed approach has some benefits and achieves robustness with two types of sensitivity analyses. Some discussions and their limitations to the approach are also provided.[[notice]]補正完