A bicriteria integer programming model for the hierarchical workforce scheduling problem

2010 ◽  
Vol 5 (1) ◽  
pp. 54-62 ◽  
Author(s):  
Rafael Pastor ◽  
Albert Corominas
Keyword(s):  
Integer Programming ◽  
Design Methodology ◽  
Programming Model ◽  
Task Assignment ◽  
Scheduling Problem ◽  
Workforce Scheduling ◽  
Content Type ◽  
Integer Programming Model ◽  
The Cost ◽  
S Model

PurposeThe purpose of this paper is to propose a bicriteria integer programming model for hierarchical workforce scheduling in which the first criterion is the cost and the second is the suitability of task assignment to individual employees. The model is based on the integer programming formulation for the hierarchical workforce scheduling problem published in 2007 by Seçkiner et al., which extends the model proposed by Billionnet in 1999.Design/methodology/approachThe principal hypothesis of this paper is that, although an employee is capable of performing several different tasks with equal efficiency, the type of task to which he/she is assigned affects the overall suitability of the assignment configuration. Therefore, cost‐minimising solutions should also optimise task assignment when possible. This paper considers real cases and confirm that this approach to the problem is appropriate for dealing with common situations in personnel management.FindingsThe proposed idea is applied to the example problem used by Seçkiner et al. and the results are compared with Seçkiner et al.'s model results.Originality/valueConsequently, the proposal is more general and a more faithful representation of the problems faced by personnel managers, which should help to bridge the gap between academic studies and practical cases.

A framework of hiring strategy for manpower hiring in a hyper-local food delivery organization

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Debadyuti Das ◽  
Chirag Yadav
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Local Food ◽  
Service Level ◽  
Food Delivery ◽  
Optimum Number ◽  
Content Type ◽  
Integer Programming Model ◽  
Cost Efficient ◽  
The Cost

PurposeThe present work attempts to determine an appropriate number of different categories of Delivery Persons for a Hyper-local Food Delivery Organization for different intervals within a day and across days within a week which would provide a satisfactory level of service to the target customers and at the same time would become cost-efficient.Design/methodology/approachCurrently the firm estimates the required number of Delivery Persons for “lunch peak” and “dinner peak” of the next week's weekdays and weekend based on the maximum number of orders occurring during the same period of both weekdays and weekend in the current week. The proposed approach involves determining the projected demand in every four-hourly interval of both week-days and weekend in the next week. Subsequently, the study has developed a simple integer programming model for determining the optimum number of Delivery Persons based on the projected demand data.FindingsThe existing approach followed by the firm indicates that the Delivery Persons remain unutilized during periods of low demand. The proposed model demonstrated savings to the tune of 21.4% in manpower cost without any erosion in the service level.Originality/valueThe study has made three tangible contributions. First, the development of a simple methodology for estimating the demand of next period allows the Managers to utilize dynamic demand data. Second, the development of a simple integer programming model helps managers determine an appropriate number of Delivery Persons in different intervals in both weekdays and weekend. Third, the development of a framework of hiring strategy aids managers in adopting a particular hiring strategy under a particular context keeping in mind the magnitude of demand for food, demand for delivery service and the cost of providing the service.

scholarly journals The unit train make-up scheme for loaded direction in the heavy haul railway

2019 ◽  
Vol 1 (1) ◽  
pp. 30-44 ◽  
Author(s):  
Yuqiang Wang ◽  
Yuguang Wei ◽  
Hua Shi ◽  
Xinyu Liu ◽  
Liyuan Feng ◽  
...  
Keyword(s):  
Integer Programming ◽  
Design Methodology ◽  
Arrival Time ◽  
Programming Model ◽  
Nonlinear Integer Programming ◽  
Content Type ◽  
Proposed Model ◽  
Heavy Haul ◽  
Heavy Haul Railway

Purpose The purpose of this paper is to study the unit train make-up scheme for loaded direction in the heavy haul railway. Design/methodology/approach A 0-1 nonlinear integer programming model with the aim of minimizing the idling period between actual train arrival time and expected train arrival time for all loaded unit trains are proposed. Findings The proposed model is applied into a case study based on Daqin heavy haul railway. Results show that the proposed model can offer operators an optimal unit train make-up scheme for loaded direction in heavy haul railway. Originality/value The proposed model can offer operators an optimal unit train make-up scheme for loaded direction in heavy haul railway.

Lagrangian Relaxation for Multiprocessor Task Scheduling Problem with Variable Job Profiles

2010 ◽  
Vol 156-157 ◽  
pp. 633-637
Author(s):  
Xiao Le Han ◽  
Zhi Qiang Lu ◽  
Li Feng Xi
Keyword(s):  
Integer Programming ◽  
Numerical Experiment ◽  
Lagrangian Relaxation ◽  
Task Scheduling ◽  
Programming Model ◽  
Scheduling Problem ◽  
Resource Assignment ◽  
Integer Programming Model ◽  
Multiprocessor Task Scheduling ◽  
Job Profile

In this paper the multiprocessor task scheduling problem with variable job profile is addressed. Such problem originates from many practical resource assignment contexts. Based on discretized parameters, the problem is formulated as an integer programming model. Due to the complexity of the problem, a Lagrangian relaxation is applied to solve the problem. The numerical experiment demonstrates the effectiveness of our algorithm procedure.

scholarly journals REDESIGNING THE ASSIGNMENT OF INTERNAL AUDITORS BASED ON AUDITOR UTILITY

2016 ◽  
Vol 4 (3) ◽  
pp. 246-259
Author(s):  
BURCU KARAÖZ
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Ahp Method ◽  
Utility Level ◽  
Total Utility ◽  
Integer Programming Model ◽  
Internal Auditors ◽  
The Cost ◽  
Novel Model

This study presents a novel model for assignment of internal auditors to branches of businesses. Previous studies have concerned with minimizing the cost but in this model, aim is maximizing auditor’s utility. For this purpose an integer programming model introduced. The objective is maximizing the auditors’ total utility. Each branch has different impact values for auditors, which indicate auditors’ utility level in terms of location, size and type of branches. Also to keep the balance of auditor’s working days and total gained impact values particular constraints are defined for the integer programming model. This implementation has 3 particular steps; first is quantification of the branches’ effects on the auditors. AHP method is used to define branches’ impact values. The second is simulating the durations of auditing process. To minimize the effect of abnormal situations, durations are simulated. Last step is to reach the rotation of auditors, total working days and the total utility of the auditor; the integer programming model is solved by Python-Gurobi Optimizer.

Sign in / Sign up

Export Citation Format

Share Document