Finding optimally balanced words for production planning and maintenance scheduling

IIE Transactions (Institute of Industrial Engineers)

Volumn 44, Issue 3, 2012, Pages 215-229

  Herrmann, Jeffrey W ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

aggregation; Balanced words; cyclic scheduling; fair sequences

Indexed keywords

ASSEMBLY LINE; ASYNCHRONOUS TRANSFER MODE NETWORKS; BALANCED WORDS; BRANCH AND BOUNDS; COMPUTATIONAL EFFORT; COMPUTATIONAL EXPERIMENT; CYCLIC SCHEDULING; FAIR SEQUENCES; FINITE SET; JUST IN TIME; MAINTENANCE SCHEDULING; OPTIMAL SOLUTIONS; PERIODIC SEQUENCE; PRODUCTION PLANNING;

AGGLOMERATION; EXPERIMENTS; JUST IN TIME PRODUCTION; OPTIMAL SYSTEMS; OPTIMIZATION; SCHEDULING;

PREVENTIVE MAINTENANCE;

EID: 84855928146     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/0740817X.2011.602660     Document Type: Article

References (18)

1. Altman, E., Gaujal, B. and Hordijk, A. (2000) Balanced sequences and optimal routing. Journal of the ACM, 47(4), 752-775.
2. Balinski, M.L. and Young, H.P. (1982) Fair Representation. Yale University Press, New Haven, CT.
3. Corominas, A., Kubiak, W. and Palli, N.M. (2007) Response time variability. Journal of Scheduling, 10, 97-110. (Pubitemid 46325886)
4. Hajek, B. (1985) Extremal splittings of point processes. Mathematics of Operations Research, 10, 543-556.
5. Herrmann, J.W. (2007) Generating cyclic fair sequences using aggregation and stride scheduling. Technical Report 2007-12, Institute for Systems Research, University ofMaryland, College Park. Available at http://hdl.handle.net/1903/ 7082 (accessed December 2, 2011).
6. Herrmann, J.W. (2009) Generating cyclic fair sequences for multiple servers. MISTA 2009, Dublin, Ireland, August 10-12, 2009.
7. Herrmann, J.W. (2010) Using aggregation to construct periodic policies for routing jobs to parallel servers with deterministic service times. Journal of Scheduling, DOI: 10.1007/s10951-010-0209-6.
8. Herrmann, J.W. (2011) Using aggregation to reduce response time variability in cyclic fair sequences. Journal of Scheduling, 14, 39-55.
9. Kubiak, W. (2004) Fair sequences, in Handbook of Scheduling: Algorithms, Models andPerformanceAnalysis,Leung, J.Y-T., (ed.). Chapman & Hall/CRC, Boca Raton, FL, pp. 19-1-19-21.
10. Kubiak,W. (2009) Proportional Optimization and Fairness, Springer, New York, NY.
11. Nowicki, E. and Smutnicki, C. (1989) Worst-case analysis of an approximation algorithm for flow shop scheduling. Operations Research Letters, 8, 171-177.
12. Rock, H. and Schmidt, G. (1983) Machine aggregation heuristics in shop scheduling. Methods of Operations Research, 45, 303-314.
13. Rogers, D.F., Plante, R.D., Wong, R.T. and Evans, J.R. (1991) Aggregation and disaggregation techniques and methodology in optimization. Operations Research, 39(4), 553-582.
14. Sano, S., Miyoshi, N. and Kataoka, R. (2004) m-balanced words: A generalization of balanced words. Theoretical Computer Science, 314(1-2), 97-120.
15. Steiner, G. and Yeomans, S. (1993) Level schedules for mixed-model, just-in-time processes. Management Science, 39(6), 728-735.
16. Van der Laan,D. (2005)Routing jobs to serverswith deterministic service times. Mathematics of Operations Research, 30(1), 195-224. (Pubitemid 43126856)
17. Waldspurger, C.A. andWeihl,W.E. (1995) Stride scheduling: Deterministic proportional-share resource management. Technical Memorandum MIT/LCS/TM-528, MIT Laboratory for Computer Science, Cambridge, MA.
18. Wei, W.D. and Liu, C.L. (1983) On a periodic maintenance problem. Operations Research Letters, 2(2), 90-93.