1997
DOI: 10.1016/s0377-2217(96)00364-5
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for single shift scheduling of hierarchical workforce

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2004
2004
2015
2015

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 35 publications
(13 citation statements)
references
References 8 publications
0
13
0
Order By: Relevance
“…For examples of recent research, see Morris and Showalter (1983), Easton and Rossin (1991), Bechtold et al (1991), Ryan (1992), Brusco andJohns (1995, 1996), Lau (1996), Narasimhan (1996), Langerman and Ehlers (1997), Caprara et al (1997), Beaumont (1997), Brusco (1998), Alfares (1998), Higgins (1998), Teodorović and Lučić (1998), Aykin (2000), Yan and Tu (2002), Yan et al (2004Yan et al ( , 2006aYan et al ( , 2006bYan et al ( , 2008aYan et al ( , 2008b. Of these, Yan et al (2008b) developed several deterministic models for mass rapid transit carriage maintenance manpower supply plans, which is more closely related to our research.…”
mentioning
confidence: 99%
“…For examples of recent research, see Morris and Showalter (1983), Easton and Rossin (1991), Bechtold et al (1991), Ryan (1992), Brusco andJohns (1995, 1996), Lau (1996), Narasimhan (1996), Langerman and Ehlers (1997), Caprara et al (1997), Beaumont (1997), Brusco (1998), Alfares (1998), Higgins (1998), Teodorović and Lučić (1998), Aykin (2000), Yan and Tu (2002), Yan et al (2004Yan et al ( , 2006aYan et al ( , 2006bYan et al ( , 2008aYan et al ( , 2008b. Of these, Yan et al (2008b) developed several deterministic models for mass rapid transit carriage maintenance manpower supply plans, which is more closely related to our research.…”
mentioning
confidence: 99%
“…To our knowledge Emmons and Burns [23] were the first to develop efficient algorithms for the "days-off-scheduling problem" with hierarchical personnel categories. More recently, integer programming and genetic algorithm based solution approaches have been developed to deal with heterogeneous workforce [24][25][26][27]. However, less attention has been paid to personnel assignment problems, which are of crucial importance in almost all manufacturing and service systems.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Constraints (26) ensure that the staffing requirements of each study are satisfied. Employees must not be assigned to conflicting, i.e.…”
Section: Objective Functionmentioning
confidence: 99%
“…In the same line of research [20] discussed necessary and sufficient condition for a labor mix to be feasible and presented one-pass method that gives the least labor cost. Reference [21] developed a mathematical model that solves the problem by determining the most economical size of various hierarchies of workers, assigning them working and off days in each week. Reference [22] illustrated that integer programming approach is well suited for solving the problem studied by Ref.…”
Section: Introductionmentioning
confidence: 99%