Energy-Based Workforce Scheduling Problem: Mathematical Model and Solution Algorithms

ScienceAsia

Volumn 31, Issue 4, 2005, Pages 383-393

  Yaoyuenyong, Kriangchai ^a   Nanthavanij, Suebsak ^a  

^a THAMMASAT UNIVERSITY   (Thailand)

Author keywords

bin packing; combinatorial optimization; workforce scheduling

Indexed keywords

EID: 56349166191     PISSN: 15131874     EISSN: None     Source Type: Journal    
DOI: 10.2306/scienceasia1513-1874.2005.31.383     Document Type: Article

References (21)

1. Bhaba RS (1986) Optimum manpower models for a production system with varying production rates. European Journal of Operational Research 24(3), 447-54.
2. Rangarajan N (1996) An algorithm for single shift scheduling of hierarchical workforce. European Journal of Operational Research 96, 113-21.
3. Vicente V, Angeles P and Sacramento Q (1996) A graph colouring model for assigning a heterogeneous workforce to a given schedule. European Journal of Operational Research 90, 285-302.
4. Vairaktaraki GL, Cai XQ and Lee CY (2002) Workforce planning in synchronous production systems. European Journal of Operational Research 136(3), 551-72.
5. National Institute for Occupational Safety and Health (NIOSH) (1981) Work practices guide for the design of manual handling task. Washington, DC.
6. Blazewicz J, Brauner N and Finke G (2004) Scheduling with discrete resource constraints. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis (Edited by Leung J Y-T), pp. 23-1 – 23-18. Chapman & Hall/CRC, Boca Raton, FL.
7. National Institute for Occupational Safety and Health (NIOSH) (1996) National occupational research agenda. Washington, DC.
8. National Institute for Occupational Safety and Health (NIOSH) (1997) Musculoskeletal disorders and workplace factors (No. 97-141). Washington, DC.
9. Kogi K, Kawakami T, Itani T and Batino JM (2003) Low-cost work improvements that can reduce the risk of musculoskeletal disorders. International Journal of Industrial Ergonomics 31(3), 179-84.
10. Musliu N, Gärtner J and Slany W (2002) Efficient generation of rotating workforce schedules. Discrete Applied Mathematics 118, 85-98.
11. Garey MR and Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, San Francisco, CA.
12. Fleszar K and Hindi S (2002) New heuristics for one-dimensional bin-packing. Computers and Operations Research 29(7), 821-39.
13. Berghammer R and Reuter F (2003) A linear approximation algorithm for bin packing with absolute approximation factor 1.5. Science of Computer Programming 48, 67-80.
14. Bourjolly JM and Rebetez V (2005) An analysis of lower bound procedures for the bin packing problem. Computers and Operations Research 32(3), 395-405.
15. Coffman EG-Jr, Csirik J and Woeginger GJ (1999) Approximate solutions to bin packing problems. In: Handbook of Applied Optimization (Edited by Pardalos PM and Resende MCG). Oxford University Press, Inc. New York, NY.
16. Friesen DK and Langston MA (1986) Variable sized bin packing. SIAM Journal of Computing 15(1), 222-30.
17. Kang J and Park S (2003) Algorithms for the variable sized bin packing problem. European Journal of Operational Research 147(2), 365-72.
18. Milind D, Jayant K, and Jay S (2001) Variable sized bin packing with color constraints. Electronic Notes in Discrete Mathematics 7, 1-4.
19. Johnson DS, Demers A, Ullman JD, Garey MR and Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithm. SIAM Journal of Computing 3(4), 299-325.
20. Martello S and Toth P (1990) Lower bounds and reduction procedure for the bin packing problem. Discrete Applied Mathematic 28, 59-70.
21. Astrand PO and Rodahl K (1986) Textbook of work physiology: physiological bases of exercise. McGraw-Hill, New York, NY.