Multi-objective Solution Approaches for Employee Shift Scheduling Problems in Service Sectors (RESEARCH NOTE)

Authors

  • Mahlagha Taghizadehalvandi Department of Industrial Engineering, Graduate School of Sciences, Eskişehir Technical University, Eskisehir, Turkey
  • Zehra Kamisli Ozturk Department of Industrial Engineering, Engineering Faculty, Eskişehir Technical University, Eskisehir, Turkey
Abstract:

Today, workforce scheduling programs are being implemented in many production and service centers. These sectors can provide better quality products and/or services to their customers, taking into account employees’ desires and preferences in order to increase sector productivity. In this study, an employee shift scheduling problem in the service sector is discussed. In the problem, the aim is to minimize the total amount of workloads of the employees and to provide the preferences of the employees. Under this multi-objective structure, by taking into account the needs of employees, a multi-objective decision model has been developed. After then, a multi-criteria decision-making model has been developed to obtain the weights/priorities of the objective functions. By the help of these obtained weights, the problem is scalarized by the Weighted Sum Scalarization (WSS) and Conic Scalarization (CS) methods. When Pareto solutions are compared, it is seen that more Pareto solutions are obtained with CS method. Additionally, better schedules have been obtained in a very short time in terms of the quality of the solution according to the manually prepared schedule.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Solution approaches to large shift scheduling problems

This paper considers large shift scheduling problems with different shift start times and lengths, fractionable breaks and work stretch duration restrictions. Two solution approaches are proposed to solve the problems over a multiple-day planning horizon. The first approach is based on a local branching strategy and the second one is based on a temporal decomposition of the problem. Local branc...

full text

Modeling and Solution Procedure for a Preemptive Multi-Objective Multi-Mode Project Scheduling Model in Resource Investment Problems

In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...

full text

VoIP service model for multi-objective scheduling in cloud infrastructure

Voice over IP (VoIP) is very fast growing technology for the delivery of voice communications and multimedia data over Internet with lower cost. Early technical solutions mirrored the architecture of the legacy telephone network. Now, they have adopted the concept of distributed cloud VoIP. These solutions typically allow dynamic interconnection between users on any domains. However, providers ...

full text

A Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach (RESEARCH NOTE)

This paper proposes a novel, bi-objective mixed-integer mathematical programming for an open shop scheduling problem (OSSP) that minimizes the mean tardiness and the mean completion time. To obtain the efficient (Pareto-optimal) solutions, a fuzzy multi-objective decision making (fuzzy MODM) approach is applied. By the use of this approach, the related auxiliary single objective formulation can...

full text

Three New Systematic Approaches for Computing Heffron-Phillips Multi-Machine Model Coefficients (RESEARCH NOTE)

This paper presents three new systematic approaches for computing coefficient matrices of the Heffron-Phillips multi-machine model (K1, …, K6). The amount of computations needed for conventional and three new approaches are compared by counting number of multiplications and divisions. The advantages of new approaches are: (1) their computation burdens are less than 73 percent of that of convent...

full text

Discrete Multi Objective Particle Swarm Optimization Algorithm for FPGA Placement (RESEARCH NOTE)

Placement process is one of the vital stages in physical design. In this stage, modules and elements of circuit are placed in distinct locations according to optimization basis. So that, each placement process tries to influence on one or more optimization factor. In the other hand, it can be told unequivocally that FPGA is one of the most important and applicable devices in our electronic worl...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 32  issue 9

pages  1312- 1319

publication date 2019-09-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023