Balancing perfectly periodic service schedules: An application from recycling and waste management

Naval Research Logistics

Volumn 59, Issue 2, 2012, Pages 160-171

  Kazan, Osman ^a   Dawande, Milind ^a   Sriskandarajah, Chelliah ^a   Stecke, Kathryn E ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

approximation algorithms; complexity; performance bounds; periodic scheduling; recycling and waste management

Indexed keywords

COMPLEXITY; DATA FILES; EFFECTIVE SOLUTION; INTEGER PROGRAMMING FORMULATIONS; OPERATING EXPENSE; OPERATIONAL COSTS; OPTIMALITY; PERFORMANCE BOUNDS; PERIODIC SCHEDULING; PLANNING HORIZONS; SERVICE CENTER; SERVICE-SCHEDULING; STRONGLY NP-HARD;

APPROXIMATION ALGORITHMS; INTEGER PROGRAMMING; SCHEDULING; WASTE MANAGEMENT;

RECYCLING;

EID: 84857637297     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.21479     Document Type: Article

References (23)

1. A. Bar-Noy, V. Dreizin, B. Patt-Shamir, Efficient periodic scheduling by trees, in: Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 2, New York, NY, USA, 2002, pp. 791-800.
2. S. K. Baruah, Fairness in periodic real-time scheduling, in: Proceedings of the 16th IEEE Real-Time Systems Symposium, IEEE Computer Society, Washington, DC, 1995, pp. 200-209.
3. BCC Research, U.S. Medical Waste Treatment, Containment, Management and Disposal Markets (2007), Available at:, 2011.
4. Z. Brakerski, V. Dreizin, B. Patt-Shamir, Dispatching in perfectly-periodic schedules, J Algorithms 49 (2003), 219-239.
5. A. M. Campbell, J. R. Hardin, Vehicle minimization for periodic deliveries, Eur J Oper Res 165 (2005), 668-684. (Pubitemid 40206348)
6. T. Cheng, C. Sin, A state-of-the-art review of parallel-machine scheduling research, Eur J Oper Res 47 (1990), 271-292.
7. K. Danne, M. Platzner, A heuristic approach to schedule periodic real-time tasks on reconfigurable hardware, in: Proceedings of the International Conference on Field Programmable Logic and Applications, Tampere, Finland, 2005, pp. 568-573. (Pubitemid 44183497)
8. M. Dawande, S. Kumar, C. Sriskandarajah, Performance bounds of algorithms for scheduling advertisements on a web page, J Scheduling 6 (2003), 373-393.
9. C. Delgado, M. Laguna, J. Pacheco, Minimizing labor requirements in a periodic vehicle loading problem, Comput Optimization Appl 32 (2005), 299-320. (Pubitemid 41406911)
10. EPA, Office of Solid Waste, Municipal Solid Waste in The United States, 2009 Facts and Figures (2010), Available at:, 2011.
11. First Research, Waste Management Industry Profile (2011), Available at:, 2011.
12. Frost & Sullivan Research Service, European Industrial Waste Management Services Markets (2007), Available at:, 2011.
13. M. R. Garey, D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Company, USA, 1979.
14. R. L. Graham, Bounds on multiprocessing timing anomalies, SIAM J Appl Math 17 (1969), 416-429.
15. O. Kermia, Y. Sorel, A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor, ISCA International Conference on Parallel and Distributed Computing Systems, Las Vegas, NV, USA, 2007, pp. 1-6.
16. Key Note Publications, Global Waste Management Market Assessment (2007), Available at:, 2011.
17. E. L. Lawler, J. K. Lenstra, A. Rinnooy Kan, D. B. Shmoys, Sequencing and scheduling: Algorithms and complexity, Handbook of operations research, Vol. 4, North-Holland, Amsterdam, 1989, pp. 445-552.
18. J. K. Lenstra, D. B. Shmoys, E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Math Program 46 (1990), 259-271.
19. A. Munier, The complexity of a cyclic scheduling problem with identical machines and precedence constraints, Eur J Oper Res 91 (1996), 471-480. (Pubitemid 126393159)
20. K. S. Park, D. K. Yun, Optimal scheduling of periodic activities, Oper Research 33 (1985), 690-695.
21. A. Salem, G. C. Anagnostopoulos, G. Rabadi, A branch-and-bound algorithm for parallel machine scheduling problems, in: Proceedings of the International Workshop on Harbour, Maritime & Multimodal Logistics Modeling and Simulation, Portofino, Italy, 2000, pp. 88-93.
22. A. Thesen, Design and evaluation of tabu search algorithms for multiprocessor scheduling, J Heuristics 4 (1998), 141-160. (Pubitemid 128514874)
23. W. D. Wei, C. L. Liu, On a periodic maintenance problem, Oper Res Lett 2 (1983), 90-93.