References
- Barrett, R., & Kadipasaoglu, S. N. (1999). Evaluation of dispatching rules in a dynamic flow shop. Production and Inventory Management Journal, 31, 54–58.
- Blackstone, J. H., Phillips, D. T., & Hogg, G. L. (1982). A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20, 27–45.10.1080/00207548208947745
- Cacciabue, P. C. (2011). Modelling and simulation of human behaviour in system control. New York, NY: Springer.
- Caskey, K., & Storch, R. L. (1996). Heterogeneous dispatching rules in job and flow shops. Production Planning & Control, 7, 351–361.
- Haupt, R. (1989). A survey of priority rule-based scheduling. OR Spektrum, 11, 3–16.10.1007/BF01721162
- Holthaus, O.. (1997). Design of efficient job shop scheduling rules. Computers and Industrial Engineering, 33, 249–252.10.1016/S0360-8352(97)00085-5
- Holthaus, O., & Rajendran, C. (1997). Efficient dispatching rules for scheduling in a job shop. International Journal of Production Economics, 48, 87–105.10.1016/S0925-5273(96)00068-0
- Jayamohan, M. S., & Rajendran, C. (2000). A comparative analysis of two different approaches to scheduling in flexible flow shops. Production Planning & Control, 11, 572–580.
- Karimi, K. (2009). New dispatching rules to minimize rejection and tardiness costs in a dynamic flexiable flow shop. International Journal of Advanced Manufacturing Technology, 45, 759–771.
- Low, C., Kung, S., & Huang, C. (2010). Using data mining to solve flow shop scheduling problems. The International Journal of Organizational Innovation, 2, 241–253.
- Monch, L., & Zimmermann, J. (2004). Improving the performance of dispatching rules in semiconductor manufacturing by iterative simulation. In Proceeding of the 2004 Winter Simulation Conference (pp. 1882–1887). Savannah, GA.
- Ramasesh, R. (1990). Dynamic job shop scheduling—A survey of simulation research. Omega, 18, 43–57.10.1016/0305-0483(90)90017-4
- Reodecha, J., & Werner, F. (2008). Algorithms for flexiableflow shop problems with unrelated parallel machines, setup times, and dual criteria. Int J Adv Manuf Technol, 37, 354–370.
- Wang, L. L., & Jin, Y. H. (2007). An effective pso-based mimetic algorithm for flow shop scheduling. IEEE Transaction on Systems, Man, and Cybernetics-Part B, 37, 18–27.
- Wiem, M., & Pierreval, H. (2010). Training a neural network to select dispatching rules in real time. Computers & Industrial Engineering, 58, 249–256.
- Wen, W., & Yang, C. L. (2013). A dynamic and automatic traffic light control system for solving the road congestion problem. In A. Pratell (Ed.), Intersections control and safety (pp. 133–142). Southampton: WIT Press.