A hybrid nested partitions algorithm for scheduling flexible resource in flow shop problem

International Journal of Production Research

Volumn 50, Issue 10, 2012, Pages 2555-2569

  Wu, Wei ^a   Wei, Junhu ^a   Guan, Xiaohong ^a,b   Shi, Leyuan ^b,c  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

^c University of Wisconsin Madison   (United States)

Author keywords

Flow shop scheduling; Manufacturing systems; Manufacturing systems engineering; Optimisation; Resource planning; Scheduling

Indexed keywords

EID: 84992212061     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2010.539278     Document Type: Article

References (36)

1. Alidaee, B. and Kochenberger, G.A., 1996. A framework for machine scheduling problems with controllable processing times. Production and Operations Management, 5 (4), 391-405.
2. Bartholdi, J.J. and Eisenstein, D.D., 1996. A production line that balances itself. Operations Research, 44 (1), 21-34.
3. Chen, W.W., Shi, L.Y., and Pi, L., 2009. Nested partitions and its applications to the intermodal hub location problem. In: C. Wanpracha and C. Kevin, eds. Optimization and logistics challenges in the enterprise. New York: Springer, 229-250.
4. Daniels, R.L., Hoopes, B.J., and Mazzola, J.B., 1996. Scheduling parallel manufacturing cells with resource flexibility. Management Science, 42 (9), 1260-1276.
5. Daniels, R.L., Hoopes, B.J., and Mazzola, J.B., 1997. An analysis of heuristics for the parallel-machine flexible-resource scheduling problem. Annals of Operations Research, 70 (1), 439-472.
6. Daniels, R.L. and Mazzola, J.B., 1993. A tabu-search heuristic for the flexible-resource flow shop scheduling problem. Annals of Operations Research, 41 (1-4), 207-230.
7. Daniels, R.L. and Mazzola, J.B., 1994. Flow shop scheduling with resource flexibility. Operations Research, 42 (3), 504-522.
8. Daniels, R.L., Mazzola, J.B., and Shi, D., 2004. Flow shop scheduling with partial resource flexibility. Management Science, 50 (5), 658-669.
9. Daniels, R.L. and Sarin, R.K., 1989. Single machine scheduling with controllable processing times and number of tardy jobs. Operations Research, 37 (6), 981-984.
10. Dsouza, W.D., et al., 2008. A nested partitions framework for beam angle optimization in intensity-modulated radiation therapy. Physics in Medicine & Biology, 53 (12), 3293-3307.
11. Guan, X.H., Ho, Y.C., and Lai, F., 2001. An ordinal optimization based bidding strategy for electric power suppliers in the daily energy market. IEEE Transactions on Power Systems, 16 (4), 788-797.
12. Guan, X.H., et al., 2006. Constrained ordinal optimization - A feasibility model based approach. Journal of DEDS, 16 (2), 279-299.
13. Hejazi, S.R. and Saghafian, S., 2005. Flowshop-scheduling problems with makespan criterion: A review. International Journal of Production Research, 43 (14), 2895-2929.
14. Ho, Y.C. and Sreenivas, R.S., 1991. Ordinal optimization of discrete event dynamic systems. Journal of DEDS, 2 (2), 61-88.
15. Jordan, W.C. and Graves, S.C., 1995. Principles on the benefits of manufacturing process flexibility. Management Science, 41 (4), 577-594.
16. Lau, T.W.E. and Ho, Y.C., 1997. Universal alignment probabilities and subset selecting for ordinal optimization. Journal of Optimization Theory and Applications, 93 (3), 455-489.
17. Lawrence, S.R. and Morton, T.E., 1993. Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics. European Journal of Operational Research, 64 (2), 168-187.
18. Lee, C.Y., Lei, L., and Pinedo, M., 1997. Current trends in deterministic scheduling. Annals of Operations Research, 70 (1), 1-41.
19. Lee, J.K. and Kim, Y.D., 1996. Search heuristics for resource constrained project scheduling. The Journal of the Operational Research Society, 47 (5), 678-689.
20. Nawaz, M., Enscore, E.J., and Ham, I., 1983. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. The International Journal of Management Science, 11 (1), 91-95.
21. Olafsson, S. and Shi, L.Y., 2000. A method for scheduling in parallel manufacturing systems with flexible resources. IIE Transactions, 32 (2), 135-146.
22. Olafsson, S. and Shi, L.Y., 2002. Ordinal comparison via the nested partitions method. Discrete Event Dynamic Systems, 12 (2), 211-239.
23. Olafsson, S. and Yang, J., 2005. Intelligent partitioning for feature selection. Informs Journal On Computing, 17 (3), 339-355.
24. Ozdamar, L. and Ulusoy, G., 1995. A survey on the resource-constrained project scheduling problem. IIE Transactions, 27 (5), 574-586.
25. Pi, L., Pan, Y.P., and Shi, L.Y., 2008. Hybrid nested partitions and mathematical programming approach and its applications. IEEE Transactions on Automation Science and Engineering, 5 (4), 573-586.
26. Sethi, A.K. and Sethi, S.P., 1990. Flexibility in manufacturing: A survey. International Journal of Flexible Manufacturing Systems, 2 (1), 289-328.
27. Shi, L.Y. and Men, S., 2003. Optimal buffer allocation in production lines. IIE Transactions, 35 (1), 1-10.
28. Shi, L.Y. and Olafsson, S., 2000. Nested partition method for global optimization. Operations Research, 48 (3), 390-407.
29. Shi, L.Y. and Olafsson, S., 2007. Nested partitions optimization. In: P. Gray and T. Klastorin, eds. TutORials in operations research 2007. Hanover, MD: Informs, 1-22.
30. Shi, L.Y., Olafsson, S., and Chen, Q., 2001. An optimization framework for product design. Management Science, 47 (12), 1681-1692.
31. Shi, L.Y., Olafsson, S., and Sun, N., 1999. New parallel randomized algorithms for the traveling salesman problem. Computers & Operations Research, 26 (4), 371-394.
32. Taillard, E., 1990. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47 (1), 65-74.
33. Talbot, F.B., 1982. Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management Science, 28 (10), 1197-1210.
34. Yang, T., Kuo, Y., and Chang, I., 2004. Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors - A case study. International Journal of Production Research, 42 (19), 4015-4030.
35. Zandieh, M. and Gholami, M., 2009. An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Production Research, 47 (24), 6999-7027.
36. Zegordi, S.H., Itoh, K., and Enkawa, T., 1995. Knowledgeable simulated annealing scheme for the early tardy flow-shop scheduling problem. International Journal of Production Research, 33 (5), 1449-1466.