A hybrid differential evolution algorithm for a two-stage flow shop on batch processing machines with arbitrary release times and blocking

References

• Ahmadi, J. H., R. H. Ahmadi, S. Dasu, and C. S. Tang. 1992. “Batching and Scheduling Jobs on Batch and Discrete Processors.” Operations Research 40 (4): 750–763.
   Web of Science ®Google Scholar
• Behnamian, J., S. M. T. Fatemi Ghomi,F. Jolai, and O. Amirtaheri. 2012. “Realistic Two-stage Flowshop Batch Scheduling Problems with Transportation Capacity and Times.” Applied Mathematical Modelling 36 (2): 723–735.
   Web of Science ®Google Scholar
• Ben Chihaoui, F., I. Kacem, A. B. Hadj-Alouane, N. Dridi, and N. Rezg. 2011. “No-wait Scheduling of a Two-machine Flow-shop to Minimise the Makespan under Non-availability Constraints and Different Release Dates.” International Journal of Production Research 49 (21): 6273–6286.
   Web of Science ®Google Scholar
• Chang, F., and C. Hwang. 2004. “Design of Digital PID Controllers for Continuous-time Plants with Integral Performance Criteria.” Journal of the Chinese Institute of Chemical Engineers 35 (6): 683–696.
   Google Scholar
• Chen, H., B. Du, and G. Q. Huang. 2011. “Scheduling a Batch Processing Machine with Non-identical Job Sizes: A Clustering Perspective.” International Journal of Production Research 49 (19): 5755–5778.
   Web of Science ®Google Scholar
• Cheng, T. C. E., B. M. T. Lin, and A. Toker. 2000. “Makespan Minimization in the Two-machine Flowshop Batch Scheduling Problem.” Naval Research Logistics 47 (2): 128–144.
   Web of Science ®Google Scholar
• Cheng, T. C. E., and G. Q. Wang. 1998. “Batching and Scheduling to Minimize the Makespan in the Two-machine Flowshop.” IIE Transactions 30 (5): 447–453.
   Web of Science ®Google Scholar
• Coffman, E. G., M. R. Garey, and D. S. Johnson. 1984. Approximation Algorithms for Bin-packing: An Updated Survey. New York: Springer Verlag.
   Google Scholar
• Damodaran, P., and K. Srihari. 2004. “Mixed Integer Formulation to Minimize Makespan in a Flow Shop with Batch Processing Machines.” Mathematical and Computer Modelling 40 (13): 1465–1472.
   Web of Science ®Google Scholar
• Glass, C. A., C. N. Potts, and V. A. Strusevich. 2001. “Scheduling Batches with Sequential Job Processing for Two-machine Flow and Open Shops.” Informs Journal on Computing 13 (2): 120–137.
   Web of Science ®Google Scholar
• Gnanavel Babu, A., J. Jerald, A. Noorul Haq, V. Muthu Luxmi, and T. P. Vigneswaralu. 2010. "Scheduling of Machines and Automated Guided Vehicles in FMS using Differential Evolution." International Journal of Production Research 48 (16): 4683–4699.
   Web of Science ®Google Scholar
• Gong, H., L. Tang, and C. Duin. 2010. “A Two-stage Flow Shop Scheduling Problem on a Batching Machine and a Discrete Machine with Blocking and Shared Setup Times.” Computers & Operations Research 37 (5): 960–969.
   Web of Science ®Google Scholar
• Hall, N. G., G.Laporte,E.Selvarajah, and C.Sriskandarajah. 2003. “Scheduling and lot Streaming in Flowshops with No-wait in Process.” Journal of Scheduling 6 (4): 339–354.
   Web of Science ®Google Scholar
• Hall, N. G., and C. Sriskandarajah. 1996. “A Survey of Machine Scheduling Problems with Blocking and No-wait in Process.” Operations Research 44 (3): 510–525.
   Web of Science ®Google Scholar
• Huang, T. C., and B. M. Lin. 2013. “Batch Scheduling in Differentiation Flow Shops for Makespan Minimisation.” International Journal of Production Research 51 (17): 5073–5082.
   Web of Science ®Google Scholar
• Hwang, F., and B. M. Lin. 2011. “Two-stage Assembly-type Flowshop Batch Scheduling Problem Subject to a Fixed Job Sequence.” Journal of the Operational Research Society 63 (6): 839–845.
   Web of Science ®Google Scholar
• Ilonen, J., J. K. Kamarainen, and J. Lampinen. 2003. “Differential Evolution Training Algorithm for Feed-forward Neural Networks.” Neural Processing Letters 17 (1): 93–105.
   Web of Science ®Google Scholar
• Kashan, A. H., and B. Karimi. 2009. “An Improved Mixed Integer Linear Formulation and Lower Bounds for Minimizing Makespan on a Flow Shop with Batch Processing Machines.” International Journal of Advanced Manufacturing Technology 40 (5–6): 582–594.
   Web of Science ®Google Scholar
• Li, X., H. Chen, B. Du, and Q. Tan. 2013. “Heuristics to Schedule Uniform Parallel Batch Processing Machines with Dynamic Job Arrivals.” International Journal of Computer Integrated Manufacturing 26 (5): 474–486.
   Web of Science ®Google Scholar
• Liao, C. J., and L. M. Liao. 2008. “Improved MILP Models for Two-machine Flowshop with Batch Processing Machines.” Mathematical and Computer Modelling 48 (7): 1254–1264.
   Web of Science ®Google Scholar
• Liao, L. M., and C. J. Huang. 2011. “Tabu Search Heuristic for Two-machine Flowshop with Batch Processing Machines.” Computers & Industrial Engineering 60 (3): 426–432.
   Web of Science ®Google Scholar
• Lin, B. M. T., and T. C. E. Cheng. 2001. “Batch Scheduling in the No-wait Two-machine Flowshop to Minimize the Makespan.” Computers & Operations Research 28 (7): 613–624.
   Web of Science ®Google Scholar
• Lin, B. M. T., and T. C. E. Cheng. 2005. “Two-machine Flowshop Batching and Scheduling.” Annals of Operations Research 133 (1–4): 149–161.
   Web of Science ®Google Scholar
• Lin, R., and C. J. Liao. 2013. “Batch Scheduling Problem for a Machinery Factory with Fixed-position Layout.” International Journal of Production Research 51 (3): 910–926.
   Web of Science ®Google Scholar
• Luo, H., G. Q. Huang, Y. F. Zhang, and Q. Y. Dai. 2011. “Hybrid Flowshop Scheduling with Batch-discrete Processors and Machine Maintenance in Time Windows.” International Journal of Production Research 49 (6): 1575–1603.
   Web of Science ®Google Scholar
• Manjeshwar, P. K., P. Damodaran, and K. Srihari. 2009. “Minimizing Makespan in a Flow Shop with Two Batch-processing Machines using Simulated Annealing.” Robotics and Computer-Integrated Manufacturing 25 (3): 667–679.
   Web of Science ®Google Scholar
• Manjeshwar, P. K., P. Damodaran, and K. Srihari. 2011. “Genetic Algorithms for Minimizing Makespan in a Flow Shop with Two Capacitated Batch Processing Machines.” The International Journal of Advanced Manufacturing Technology 55 (9–12): 1171–1182.
   Web of Science ®Google Scholar
• Onwubolu, G., and D. Davendra. 2006. “Scheduling Flow Shops using Differential Evolution Algorithm.” European Journal of Operational Research 171 (2): 674–692.
   Web of Science ®Google Scholar
• Oulamara, A. 2007. “Makespan Minimization in a No-wait Flow Shop Problem with Two Batching Machines.” Computers & Operations Research 34 (4): 1033–1050.
   Web of Science ®Google Scholar
• Oulamara, A., M. Y. Kovalyov, and G. Finke. 2005. “Scheduling a No-wait Flow Shop Containing Unbounded Batching Machines.” IIE Transactions 37 (8): 685–696.
   Web of Science ®Google Scholar
• Pan, Q. K., M. F. Tasgetiren, and Y. C. Liang. 2008. “A Discrete Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem.” Computers & Industrial Engineering 55 (4): 795–816.
   Web of Science ®Google Scholar
• Pan, Q. K., L. Wang, L. Gao, and W. D. Li. 2011. “An Effective Hybrid Discrete Differential Evolution Algorithm for the Flow Shop Scheduling with Intermediate Buffers.” Information Sciences 181 (3): 668–685.
   Web of Science ®Google Scholar
• Potts, C., V. Strusevich, and T. Tautenhahn. 2001. “Scheduling Batches with Simultaneous Job Processing for Two-machine Shop Problems.” Journal of Scheduling 4 (1): 25–51.
   Web of Science ®Google Scholar
• Qian, B., L. Wang, D. X. Huang, and X. Wang. 2009. “An Effective Hybrid DE-based Algorithm for Flow Shop Scheduling with Limited Buffers.” International Journal of Production Research 47 (1): 1–24.
   Web of Science ®Google Scholar
• Rossi, A., A. Puppato, and M. Lanzetta. 2013. “Heuristics for Scheduling a Two-stage Hybrid Flow Shop with Parallel Batching Machines: Application at a Hospital Sterilisation Plant.” International Journal of Production Research 51 (8): 2363–2376.
   Web of Science ®Google Scholar
• Ruzek, B., and M. Kvasnicka. 2001. “Differential Evolution Algorithm in the Earthquake Hypocenter Location.” Pure and Applied Geophysics 158 (4): 667–693.
   Web of Science ®Google Scholar
• Storn, R., and K. Price. 1997. “Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces.” Journal of Global Optimization 11 (4): 341–359.
   Web of Science ®Google Scholar
• Su, L. H. 2003. “A Hybrid Two-stage Flowshop with Limited Waiting Time Constraints.” Computers & Industrial Engineering 44 (3): 409–424.
   Web of Science ®Google Scholar
• Sung, C. S., and Y. H. Kim. 2002. “Minimizing Makespan in a Two-machine Flowshop with Dynamic Arrivals Allowed.” Computers & Operations Research 29 (3): 275–294.
   Web of Science ®Google Scholar
• Sung, C. S., and Y. H. Kim. 2003. “Minimizing Due Date Related Performance Measures on Two Batch Processing Machines.” European Journal of Operational Research 147 (3): 644–656.
   Web of Science ®Google Scholar
• Sung, C. S., Y. H. Kim, and S. H. Yoon. 2000. “A Problem Reduction and Decomposition Approach for Scheduling for a Flowshop of Batch Processing Machines.” European Journal of Operational Research 121 (1): 179–192.
   Web of Science ®Google Scholar
• Sung, C. S., and J. I. Min. 2001. “Scheduling in a Two-machine Flowshop with Batch Processing Machine(s) for Earliness/Tardiness Measure under a Common Due Date.” European Journal of Operational Research 131 (1): 95–106.
   Web of Science ®Google Scholar
• Tang, L. X., and P. Liu. 2009a. “Minimizing Makespan in a Two-machine Flowshop Scheduling with Batching and Release Time.” Mathematical and Computer Modelling 49 (5–6): 1071–1077.
   Web of Science ®Google Scholar
• Tang, L., and P. Liu. 2009b. “Flowshop Scheduling Problems with Transportation or Deterioration between the Batching and Single Machines.” Computers & Industrial Engineering 56 (4): 1289–1295.
   Web of Science ®Google Scholar
• Tasgetiren, M. F., Q. K. Pan, P. N. Suganthan, and T. J. Chua. 2011. “A Differential Evolution Algorithm for the No-idle Flowshop Scheduling Problem with Total Tardiness Criterion.” International Journal of Production Research 49 (16): 5033–5050.
   Web of Science ®Google Scholar
• Uzsoy, R. 1994. “Scheduling a Single Batch Processing Machine with Nonidentical Job Sizes.” International Journal of Production Research 32 (7): 1615–1635.
   Web of Science ®Google Scholar
• Uzsoy, R., C. Y. Lee, and L. A. Martin-Vega. 1992. “A Review of Production Planning and Scheduling Models in the Semiconductor Industry Part I: System Characteristics, Performance Evaluation and Production Planning.” IIE Transactions 24 (4): 47–60.
   Web of Science ®Google Scholar
• Van De Rzee, D. J., A. Van Harten, and P. C. Schuur. 1997. “Dynamic Job Assignment Heuristics for Multi-server Batch Operations – A Cost Based Approach.” International Journal of Production Research 35 (11): 3063–3094.
   Web of Science ®Google Scholar
• Wang, L., Q. K. Pan, P. N.Suganthan, W. H. Wang, and Y. M. Wang. 2010. “A Novel Hybrid Discrete Differential Evolution Algorithm for Blocking Flow Shop Scheduling Problems.” Computers & Operations Research 37 (3): 509–520.
   Web of Science ®Google Scholar
• Xu, R., H. Chen, and X. Li. 2013. “A Bi-objective Scheduling Problem on Batch Machines via a Pareto-based Ant Colony System.” International Journal of Production Economics 145 (1): 371–386.
   Web of Science ®Google Scholar
• Yao, F. S., M. Zhao, and H. Zhang. 2012. “Two-stage Hybrid Flow Shop Scheduling with Dynamic Job Arrivals.” Computers & Operations Research 39 (7): 1701–1712.
   Web of Science ®Google Scholar
• Yugma, C., S. Dauzère-Pérès, C. Artigues, A. Derreumaux, and O. Sibille. 2012. “A Batching and Scheduling Algorithm for the Diffusion Area in Semiconductor Manufacturing.” International Journal of Production Research 50 (8): 2118–2132.
   Web of Science ®Google Scholar
• Zheng, X. J., and H. F. Teng. 2010. “A Relative Position-coded Differential Evolution for Loop-based Station Sequencing Problem.” International Journal of Production Research 48 (18): 5327–5344.
   Web of Science ®Google Scholar
• Zhou, S., H. Chen, R. Xu, and X. Li. 2013. “Minimising Makespan on a Single Batch Processing Machine with Dynamic Job Arrivals and Non-identical Job Sizes.” International Journal of Production Research. 52 (8): 2258–2274.
   Web of Science ®Google Scholar
• Zhu, Q. Y., A. K. Qin, P. N. Suganthan, and G. B. Huang. 2005. “Evolutionary Extreme Learning Machine.” Pattern Recognition 38 (10): 1759–1763.
   Web of Science ®Google Scholar