Balancing perfectly periodic service schedules: An application from recycling and waste management Academic Article uri icon

abstract

  • A national recycling and waste management company provides periodic services to its customers from over 160 service centers. The services are performed periodically in units of weeks over a planning horizon. The number of truck-hours allocated to this effort is determined by the maximum weekly workload during the planning horizon. Therefore, minimizing the maximum weekly workload results in minimum operating expenses. The perfectly periodic service scheduling (PPSS) problem is defined based on the practices of the company. It is shown that the PPSS problem is strongly NP-hard. Attempts to solve large instances by using an integer programming formulation are unsuccessful. Therefore, greedy BestFit heuristics with three different sorting schemes are designed and tested for six real-world PPSS instances and 80 randomly generated data files. The heuristics provide effective solutions that are within 2% of optimality on average. When the best found BestFit schedules are compared with the existing schedules, it is shown that operational costs are reduced by 18% on average. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 160-171, 2012 Copyright © 2012 Wiley Periodicals, Inc.

altmetric score

  • 3

author list (cited authors)

  • Kazan, O., Dawande, M., Sriskandarajah, C., & Stecke, K. E.

citation count

  • 2

complete list of authors

  • Kazan, Osman||Dawande, Milind||Sriskandarajah, Chelliah||Stecke, Kathryn E

publication date

  • February 2012

publisher