2012 A two-stage heuristic for multi-activity and task assignment to work shifts外文翻译.pdfVIP

Computers Industrial Engineering 63 (2012) 831–841 Contents lists available at SciVerse ScienceDirect Computers Industrial Engineering journal homepage: /locate/caie A two-stage heuristic for multi-activity and task assignment to work shifts Quentin Lequy a, Guy Desaulniers a,⇑, Marius M. Solomon b a École Polytechnique de Montréal and GERAD, Département de Mathématiques et de Génie Industriel, C.P. 6079, Succ. Centre-Ville, Montréal, Québec, Canada H3C 3A7 b Northeastern University and GERAD, College of Business Administration, Information, Operations and Analysis Group, 360 Huntington Avenue, Boston, MA 02115, USA a r t i c l e i n f o a b s t r a c t Article history: The multi-activity assignment problem consists of assigning interruptible activities to given work shifts Received 26 April 2011 so as to match as much as possible for each activity a demand curve in function of time. In this paper we Received in revised form 18 May 2012 consider an extension to this problem, called the multi-activity and task assignment problem, that addi- Accepted 27 May 2012 tionally considers the assignment of uninterruptible pieces of work, called tasks. These possess properties Available online 5 June 2012 such as worker qualifications, time windows for completion, fixed lengths and precedence relationships. We propose a mixed-integer programming formulation and a two-stage method to solve this problem. Keywords: T