Article ID: | iaor2009247 |
Country: | Netherlands |
Volume: | 179 |
Issue: | 2 |
Start Page Number: | 554 |
End Page Number: | 566 |
Publication Date: | Jun 2007 |
Journal: | European Journal of Operational Research |
Authors: | Ramanathan R., Mathirajan M. |
Keywords: | programming: goal, programming: integer, programming: travelling salesman |
This paper addresses the problem of scheduling the tour of a marketing executive (ME) of a large electronics manufacturing company in India. In this problem, the ME has to visit a number of customers in a given planning period. The scheduling problem taken up in this study is different from the various personnel scheduling problems addressed in the literature. This type of personnel scheduling problem can be observed in many other situations such as periodical visits of inspection officers, tour of politicians during election campaigns, tour of mobile courts, schedule of mobile stalls in various areas, etc. In this paper the tour scheduling problem of the ME is modeled using (0–1) goal programming (GP). The (0–1) GP model for the data provided by the company for 1 month has 802 constraints and 1167 binary variables. The model is solved using LINDO software package.