LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times

Photo from academic.microsoft.com

ABSTRACT Only a few studies in the available scientific literature address the problem of having a group of workers that do not share identical levels of productivity during the planning… Click to show full abstract

ABSTRACT Only a few studies in the available scientific literature address the problem of having a group of workers that do not share identical levels of productivity during the planning horizon. This study considers a workforce scheduling problem in which the actual processing time is a function of the scheduling sequence to represent the decline in workers’ performance, evaluating two classical performance measures separately: makespan and maximum tardiness. Several mathematical models are compared with each other to highlight the advantages of each approach. The mathematical models are tested with randomly generated instances available from a public e-library.

Keywords: integer linear; programming models; workforce scheduling; linear programming; comparison mixed; mixed integer

Journal Title: Engineering Optimization
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.