Solving parallel machines job-shop scheduling problems by an adaptive algorithm

References

• Abdolzadeh, M., and H. Rashidi. 2010. “An Approach of Cellular Learning Automata to Job Shop Scheduling Problem.” International Journal of Simulation: Systems, Science and Technology 11 (2): 56–64.
   Google Scholar
• Bagheri, A., M. Zandieh, I. Mahdavi, and M. Yazdani. 2010. “An Artificial Immune Algorithm for the Flexible Job-shop Scheduling Problem.” Future Generation Computer Systems 26: 533–541.
   Web of Science ®Google Scholar
• Bozejko, W., M. Uchronski, and M. Wodecki. 2010. “Parallel Hybrid Metaheuristics for the Flexible Job Shop Problem.” Computers & Industrial Engineering 59 (2): 323–333.
   Web of Science ®Google Scholar
• Chen, J. C., C.-C. Wu, C.-W. Chen, and K.-H. Chen. 2012. “Flexible Job Shop Scheduling with Parallel Machines Using Genetic Algorithm and Grouping Genetic Algorithm.” Expert Systems with Applications 39: 10016–10021.
   Web of Science ®Google Scholar
• Chiang, T.-C., and H.-J. Lin. 2012. “A Simple and Effective Evolutionary Algorithm for Multi-objective Flexible Job Shop Scheduling.” International Journal of Production Economics. [Article in Press]. http://dx.doi.org/10.1016/j.ijpe.2012.03.034
   Google Scholar
• Demir, Y., and S. K. Isleyen, in press. “Evoluation of Mathematical Models for Flexible Job-shop Scheduling Problems.” Applied Mathematical Modelling. http://dx.doi.org/10.1016/j.apm.2012.03.020
   Google Scholar
• Dorndorf, U., and E. Pesch. 1995. “Evoluation Based Learning in a Job Shop Scheduling Environment.” Computers & Operations Research 22 (1): 25–40.
   Web of Science ®Google Scholar
• Gabel, T., and M. Riedmiller. 2007. “Adaptive Reactive Job-shop Scheduling with Learning Agents.” International Journal of Information Technology and Intelligent Computing 2 (4): 1–30.
   Google Scholar
• Gao, J., L. Sun, and M. Gen. 2008. “A Hybrid Genetic and Variable Neighborhood Descent Algorithm for Flexible Job Shop Scheduling Problems.” Computers & Operations Research 35: 2892–2907.
   Web of Science ®Google Scholar
• Garey, M. R., D. S. Johnson, and R. Sethi. 1976. “The Complexity of the Flowshop and Jobshop Scheduling.” Mathematics of Opertional Research 1: 117–129.
   Google Scholar
• Geiger, C. D., R. Uzsoy, and H. Aytug. 2006. “Rapid Modelling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach.” Journal of Scheduling 9: 7–34.
   Web of Science ®Google Scholar
• Gen, M., L. Lin, and H. Zhang. 2009. “Evolutionary Techniques for Optimization Problems in Integrated Manufacturig System: State-of-the-Art-Survey.” Computers & Industrial Engineering 56: 779–808.
   Web of Science ®Google Scholar
• Gholami, O., Y. N. Sotskov, and F. Werner. 2012. “Job-shop Problems with Objectives Appropriate to Train Scheduling in a Single-track Railway.” In SIMULTECH 2012 – Proceedings of 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Rome, May 21, 2012, 425–430.
   Google Scholar
• Gomes, M. C., A. P. Barbosa-Povoa, and A. Q. Novais. 2005. “Optimal Scheduling for Flexible Job Shop Operations.” International Journal of Production Research 43 (11): 2323–2353.
   Web of Science ®Google Scholar
• Graham, R. L., E. R. Lawler, and J. K. Lenstra. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326.
   Google Scholar
• Hmida, A. B., M. Haouari, M. J. Huguet, and P. Lopez. 2010. “Discrepancy Search for the Flexible Job Shop Scheduling Problem.” Computers & Operations Research 37 (12): 2192–2201.
   Web of Science ®Google Scholar
• Karimi, N., M. Zandieh, and H. R. Karamoozz. 2010. “Bi-objective Group Scheduling in Hybrid Flexible Flowshop: A Nulti-phase Approach.” Expert Systems with Applications 37: 4024–4032.
   Web of Science ®Google Scholar
• Krüger, K., Y. N. Sotskov, and F. Werner. 1998. “Heuristic for Generalized Shop Scheduling Problems Based on Decomposition.” International Journal of Production Research 36 (11): 3013–3033.
   Web of Science ®Google Scholar
• Lawrence, S. 1984. Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques. Graduate School of Industrial Administration. Pittsburgh, P.A: Carniege-Mellon University.
   Google Scholar
• Li, D.-C., and T.-S. Shi. 1994. “Using Unsupervised Learning Technologies to Induce Scheduling Knowledge for FMSs.” International Journal of Production Research 32 (9): 2187–2199.
   Web of Science ®Google Scholar
• Li, J., Q. Pan, and S. Xie. 2012. “An Effective Shuffed Flog-leaping Algorithm for Multi-objective Flexible Job Shop Scheduling Problems.” Aplied Mathematics and Computation 218: 9353–9371.
   Web of Science ®Google Scholar
• Lushy, R. M., J. Larsen, M. Ehrgott, and D. Ryan. 2011. “Railway Track Allocation: Models and Methods.” OR Spectrum 33: 843–883.
   Web of Science ®Google Scholar
• Mouelhi-Chibani, W., and H. Pierreval. 2010. “Training a Neural Network to Select Dispatching Rules in Real Time.” Computers & Industrial Engineering 58: 249–256.
   Web of Science ®Google Scholar
• Muth, J. F., and G. L. Thompson. 1963. Industrial Scheduling. Englewood Cliffs, N.J.: Prentice-Hal.
   Google Scholar
• Panwalkar, S. S., and W. Iskander. 1977. “A Survey of Scheduling Rules.” Operations Research 25 (1): 45–61.
   Web of Science ®Google Scholar
• Rossi, A., and E. Boschi. 2009. “A Hybrid Heuristic to Solve the Parallel Machines Job-shop Scheduling Problem.” Advances in Engineering Software 40: 118–127.
   Web of Science ®Google Scholar
• Shakhlevich, N. V., Y. N. Sotskov, and F. Werner. 1996. “Adaptive Scheduling Algorithm Based on Mixed Graph Model.” IEE Proceedings: Control Theory and Applications 143 (1): 9–16.
   Google Scholar
• Sotskov, Y. N., and N. V. Shakhlevich. 1995. “NP-hardness of Shop-scheduling Problems with Three Jobs.” Discrete Applied Mathematics 59: 237–266.
   Web of Science ®Google Scholar
• Tanaev, V. S., Y. N. Sotskov, and V. A. Strusevich. 1994. Scheduling Theory: Multi-stage Systems. Dordrecht: Kluwer Academic Publishers. 1994.
   Google Scholar
• Thulasiraman, K., and M. N. S. Swamy. 1992. Graph: Theory and Algorithms. New York: John Wiley & Sons.
   Google Scholar
• Xing, L.-N., Y.-W. Chen, and K.-W. Yang. 2009. “Multi-objective Flexible Jobshop Schedule: Design and Evaluation by Simulation Modeling.” Applied Soft Computing 9 (1): 362–376.
   Web of Science ®Google Scholar
• Zhang, G., L. Gao, and Y. Shi. 2011. “An Effective Genetic Algorithm for the Flexible Job-shop Scheduling Problem.” Expert Systems with Applications 38: 3563–3573.
   Web of Science ®Google Scholar