Mathematical modelling and a meta-heuristic for flexible job shop scheduling

References

• Al-Hinai, N., and T. Y. ElMekkawy. 2011. “An Efficient Hybridized Genetic Algorithm Architecture for the Flexible Job Shop Scheduling Problem.” Flexible Services and Manufacturing Journal 23(1): 64–85.
   Web of Science ®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(4): 533–541.
   Web of Science ®Google Scholar
• Barnes, J. W., and J. B. Chambers. 1996. “Flexible Job Shop Scheduling by Tabu Search.” Graduate program in operations research and industrial engineering. Technical Report ORP 9609, University of Texas, Austin. http://www.cs.utexas.edu/users/jbc/
   Google Scholar
• Bowman, E. H. 1959. “Schedule-Sequencing Problem.” Operations Research 7(5): 612–614.
   Web of Science ®Google Scholar
• Brandimarte, P. 1993. “Routing and Scheduling in a Flexible Job Shop by Tabu Search.” Annals of Operations Research 41(1–4): 157–183.
   Google Scholar
• Brucker, P., and R. Schlie. 1990. “Job-Shop Scheduling with Multi-Purpose Machines.” Computing 45(4): 369–375.
   Web of Science ®Google Scholar
• Chen, H., J. Ihlow, and C. Lehmann. 1999. “A Genetic Algorithm for Flexible Job-Shop Scheduling.” Proceedings of International Conference on Robotics and Automation, 10–15 May 1999, Piscataway, NJ: IEEE.
   Google Scholar
• Dauzere-Peres, S., and J. Paulli. 1997. “An Integrated Approach for Modeling and Solving the General Multiprocessor Job-Shop Scheduling Problem Using Tabu Search.” Annals of Operations Research 70: 281–306.
   Web of Science ®Google Scholar
• Fattahi, P., M. S. Mehrabad, and F. Jolai. 2007. “Mathematical Modeling and Heuristic Approaches to Flexible Job Shop Scheduling Problems.” Journal of Intelligent Manufacturing 18(3): 331–342.
   Web of Science ®Google Scholar
• French, S. 1982. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Chichester: Ellis Horwood.
   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 and Operations Research 35(9): 2892–2907.
   Web of Science ®Google Scholar
• Garey, M. R., D. S. Johnson, and R. Sethi. 1976. “The Complexity of Flowshop and Jobshop Scheduling.” Mathematics of Operations Research 1(2): 117–129.
   Google Scholar
• Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization and Machine learning. Reading, MA: Addison-Wesley.
   Google Scholar
• Hurink, J., B. Jurisch, and M. Thole. 1994. “Tabu Search for the Job-Shop Scheduling Problem with Multi-Purpose Machines.” OR Spektrum 15(4): 205–215.
   Google Scholar
• Kacem, I., S. Hammadi, and P. Borne. 2002. “Approach by Localization and Multiobjective Evolutionary Optimization for Flexible Job-Shop Scheduling Problems.” IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) 32 (1): 1–13.
   Google Scholar
• Kesen, S. E., and Z. Gungor. 2012. “Job Scheduling in Virtual Manufacturing Cells with Lot-Streaming Strategy: A New Mathematical Model Formulation and a Genetic Algorithm Approach.” Journal of the Operational Research Society 63(5): 683–695.
   Web of Science ®Google Scholar
• Liao, C.-J., and C.-T. You. 1992. “Improved Formulation for the Job-Shop Scheduling Problem.” Journal of the Operational Research Society 43(11): 1047–1054.
   Web of Science ®Google Scholar
• Manne, A. S. 1960. “On Job-Shop Scheduling Problem.” Operations Research 8(2): 219–223.
   Web of Science ®Google Scholar
• Mastrolilli, M., and L. M. Gambardella. 2000. “Effective Neighbourhood Functions for the Flexible Job Shop Problem.” Journal of Scheduling 3(1): 3–20.
   Google Scholar
• Naderi, B., and R. Ruiz. 2010. “The Distributed Permutation Flowshop Scheduling Problem.” Computers and Operations Research 37(4): 754–768.
   Web of Science ®Google Scholar
• Naderi, B., M. Zandieh, A. K. Ghoshe Balagh, and V. Roshanaei. 2009. “An Improved Simulated Annealing for Hybrid Flowshops with Sequence-Dependent Setup and Transportation Times to Minimize Total Completion Time and Total Tardiness”. Expert Systems with Applications 36 (6): 9625–9633.
   Google Scholar
• Naderi, B., M. Zandieh, and V. Roshanaei. 2009. “Scheduling Hybrid Flowshops with Sequence Dependent Setup Times to Minimize Make-Span and Maximum Tardiness”. International Journal of Advanced Manufacturing Technology 41 (11): 1186–1198.
   Google Scholar
• Ozguven, C., L. Ozbakir, and Y. Yavuz. 2010. “Mathematical Models for Job-Shop Scheduling Problems with Routing and Process Plan Flexibility.” Applied Mathematical Modelling 34(6): 1539–1548.
   Web of Science ®Google Scholar
• Ozguven, C., Y. Yavuz, and L. Ozbakir. 2012. “Mixed Integer Goal Programming Models for the Flexible Job-Shop Scheduling Problems with Separable and Non-Separable Sequence Dependent Setup times.” Applied Mathematical Modelling 36(2): 846–858.
   Web of Science ®Google Scholar
• Pan, C.-H. 1997. “Study of Integer Programming Formulations for Scheduling Problems.” International Journal of Systems Science 28(1): 33–41.
   Web of Science ®Google Scholar
• Pezzella, F., G. Morganti, and G. Ciaschetti. 2008. “A Genetic Algorithm for the Flexible Job-Shop Scheduling Problem.” Computers and Operations Research 35(10): 3202–3212.
   Web of Science ®Google Scholar
• Pinedo, M. 2002. Scheduling: Theory, Algorithms and Systems. Englewood Cliffs, NJ: Prentice-Hall.
   Google Scholar
• Roshanaei, V., H. ElMaraghy, and A. Azab. 2012. “Sequence-based MILP Modeling for Flexible Job Shop Scheduling.” Proceedings of IIE conference & expo 2012, Orlando, Florida, USA, May 19–23.
   Google Scholar
• Roshanaei, V., M. M. Seyyed Esfehani, and M. Zandieh. 2010. “Integrating Non-Preemptive Open Shops Scheduling with Sequence-Dependent Setup times Using Advanced Metaheuristics.” Expert Systems with Applications 37(1): 259–266.
   Web of Science ®Google Scholar
• Stafford, E. F. 1988. “On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem.” Journal of the Operational Research Society 39(12): 1163–1174.
   Web of Science ®Google Scholar
• Stafford Jr, E. F., and F. T. Tseng. 2005. “Comparative Evaluation of MILP Flowshop Models.” Journal of the Operational Research Society 56(1): 88–101.
   Web of Science ®Google Scholar
• Vancza, J., T. Kis, and A. Kovacs. 2004. “Aggregation – The Key to Integrating Production Planning and Scheduling.” CIRP Annals – Manufacturing Technology 53(1): 377–380.
   Web of Science ®Google Scholar
• Wagner, H. M. 1959. “An Integer Linear-Programming Model for Machine Scheduling.” Nav. Res. Logist. Quart. 6: 131–140.
   Google Scholar
• Wiendahl, H. P., H. A. ElMaraghy, P. Nyhuis, M. F. Zah, H. H. Wiendahl, N. Duffie, and M. Brieke. 2007. “Changeable Manufacturing – Classification, Design and Operation.” CIRP Annals – Manufacturing Technology 56(2): 783–809.
   Web of Science ®Google Scholar
• Wilson, J. M. 1989. “Alternative Formulations of a Flow-Shop Scheduling Problem.” Journal of the Operational Research Society 40(4): 395–399.
   Web of Science ®Google Scholar
• Xia, W., and Z. Wu. 2005. “An Effective Hybrid Optimization Approach for Multi-Objective Flexible Job-Shop Scheduling Problems.” Computers and Industrial Engineering 48(2): 409–425.
   Web of Science ®Google Scholar
• Yazdani, M., M. Amiri, and M. Zandieh. 2010. “Flexible Job-Shop Scheduling with Parallel Variable Neighborhood Search Algorithm.” Expert Systems with Applications 37(1): 678–687.
   Web of Science ®Google Scholar
• Zandieh, M., S. M. T. Fatemi Ghomi, and S. M. Moattar Husseini. 2006. “An Immune Algorithm Approach to Hybrid Flow Shops Scheduling with Sequence-Dependent Setup times.” Applied Mathematics and Computation (New York) 180(1): 111–127.
   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(4): 3563–3573.
   Web of Science ®Google Scholar