Skilled workforce scheduling in Service Centres

Valls, Vicente; Pérez, Ángeles; Quintanilla, Sacramento

doi:10.1016/j.ejor.2007.11.008

Cited by 117 publications

(75 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Since there is no special problem instance in the field of the MSPSP [6,9,12], some reasonable instances are generated randomly with a different number of activities and features,as listed in Table 1. In order to analyse the developed algorithms further, the problem is solved in small stepsby the Lingo 9 software to find the exact solution.…”

Section: Computational Resultsmentioning

confidence: 99%

“…In order to exhibit the strength of the algorithm, they also found a lower bound for the problem and compared the generated solutions with this bound. Another example of research on solving a manpower scheduling problem in projects is that done by Valls et al [12]. They recommended a hybrid genetic algorithm (GA) to solve a skilled manpower scheduling problem in computer centres.…”

Section: Staff Membermentioning

confidence: 99%

See 1 more Smart Citation

Solving a novel multi-skilled project scheduling model by scatter search

Kazemipoor¹,

Tavakkoli–Moghaddam²,

Shahnazari-Shahrezaei³

2013

sajie

View full text Add to dashboard Cite

A multi-skilled project scheduling problem (MSPSP) has generally been presented to schedule information technology projects in deterministic conditions. The contribution of this model is to consider the resources, called 'staff members'. These members are regarded as valuable, renewable, and discrete resources with different multiple skills. The different skills of staff members, as well as the project network's activity requirement of different skills, cause this problem to become a special type of multi-mode resourceconstrained project scheduling problem (MM-RCPSP), with a huge number of modes. Taking into account the importance of this issue and the few studies performed on this problem, a novel mathematical model for the MSPSP is presented. Since the complexity of this problem is NP-hard, an efficient scatter search (SS) algorithm is developed to solve such a difficult problem. This proposed SS is capable of generating optimised solutions in small sizes, and the excellent solutions in large sizes are compared with the solutions reported by a proposed Tabu search (TS) algorithm. OPSOMMING'n Veeldoel projekskeduleringsvraagstuk (MSPSP) word voorgehou vir skedulering onder deterministiese toestande van inligtingstegnologieprojekte. Die model word aangewend vir hulpbronne genaamd "personeellede". Die bronne is waardevol, hernubaar, diskreet en beskik oor uiteenlopende vaardighede. Die eienskappe van die vraagstuk berus by uiteenlopendheid. Vir die voorafgaande omstandighede word 'n nuwe model geskep vir die hantering van eienaardighede. Aangesien die problem NP-moeilik is, word 'n doeltreffende spreisoek-algoritme gebruik met groot sukses.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

Section: Staff Membermentioning

confidence: 99%

Solving a novel multi-skilled project scheduling model by scatter search

Kazemipoor¹,

Tavakkoli–Moghaddam²,

Shahnazari-Shahrezaei³

2013

sajie

View full text Add to dashboard Cite

show abstract

“…Valls et al (2009) proposed a hybrid genetic algorithm to obtain a feasible scheduling plan and a balanced and efficient assignment of workforce to tasks for a SWPS problem. Corominas et al (2010) considered the problem of assigning and scheduling a set of tasks to a set of workers, according to which worker's performance for a given task depends on the worker experience.…”

Section: Literature Reviewmentioning

confidence: 99%

Heterogeneous workers with learning ability assignment in a cellular manufacturing system

Fichera¹,

Costa²,

Cappadonna³

2017

10.5267/j.ijiec

View full text Add to dashboard Cite

This paper deals with Flow-shop Sequence-Dependent Group Scheduling and worker assignment problem. Flow-shop allows the process of a set of families of products applying the group technology concept to reduce setup costs, lead times, and work-in-process inventory costs. The worker assignment problem deals with assigning workers to workstations considering their different abilities and learning effect. The proposed model in this paper considers different objectives. The decision problems in this cellular manufacturing system are the jobs scheduling within of own group, the group scheduling and the workers assignment to the machines. The aim of this paper is to consider a more realistic profile of heterogeneous workers introducing the learning effect in the joint group scheduling and workers assignment problem. A mathematical model and an evolutionary procedure has been developed to solve this problem. A benchmark of test cases having different numbers of machines, groups, jobs, worker skills and learning index, has been taken into account to compare the efficiency of the proposed algorithm with two well known procedures.

show abstract

“…Providing a schedule that almost satisfies all constraints and objectives is often troublesome, and needs specialised knowledge. Different classifications of manpower are observed in industrial and service environments, including homogeneous and heterogeneous, part-time and full-time, skilled and unskilled workforces, and so on [21,36,49,52]. Manpower scheduling and simultaneous allocation have been much considered by researchers.…”

Section: Introductionmentioning

confidence: 99%

A Differential Evolution Algorithm Developed for a Nurse Scheduling Problem

Shahnazari-Shahrezaei

Tavakkoli–Moghaddam

Azarkish

et al. 2012

sajie

View full text Add to dashboard Cite

Nurse scheduling is a type of manpower allocation problem that tries to satisfy hospital managers' objectives and nurses' preferences as much as possible by generating fair shift schedules. This paper presents a nurse scheduling problem based on a real case study, and proposes two meta-heuristics -a differential evolution algorithm (DE) and a greedy randomised adaptive search procedure (GRASP) -to solve it. To investigate the efficiency of the proposed algorithms, two problems are solved. Furthermore, some comparison metrics are applied to examine the reliability of the proposed algorithms. The computational results in this paper show that the proposed DE outperforms the GRASP. OPSOMMINGVerpleegsterskedulering is 'n mannekragtoedelingsprobleem wat deur regverdige skofskedules beide hospitaalbestuurders se teikens en verpleegpersoneel se voorkeure bevredig. Dié artikel handel oor 'n verpleegsterskeduleringprobleem wat gebaseer is op 'n werklike gevallestudie en stel twee metaheuristieke voor om die probleem op te los -'n differensiaal evolusionêre metode en 'n gulsige, ewekansige, aanpasbare soekprosedure. Om die doeltreffendheid van die voorgestelde algoritmes te ondersoek word twee probleme opgelos. Verder word vergelykende maatstawwe gebruik om die betroubaarheid van die voorgestelde algoritmes te ondersoek. Die berekende resultate in die artikel toon dat die differensiaal evolusionêre algoritme beter vaar as die gulsige, ewekansige, aanpasbare soekprosedure.

show abstract

Skilled workforce scheduling in Service Centres

Cited by 117 publications

References 11 publications

Solving a novel multi-skilled project scheduling model by scatter search

Solving a novel multi-skilled project scheduling model by scatter search

Heterogeneous workers with learning ability assignment in a cellular manufacturing system

A Differential Evolution Algorithm Developed for a Nurse Scheduling Problem

Contact Info

Product

Resources

About