The variable neighborhood search for the two machine flow shop problem with a passive prefetch

P. A. Kononova, “Lower and Upper Bounds for the Optimal Makespan in the Multimedia Problem,” Diskretn. Anal. Issled. Oper. 19(1), 59–73 (2012).

Yu. A. Kochetov, N. Mladenović, and P. Hansen, “Local Search with Alternating Neighborhoods,” Diskretn. Anal. Issled. Oper. Ser. 2, 10(1) 11–43 (2003).

J. Brimberg, P. Hansen, and N. Mladenović, “Convergence of Variable Neighborhood Search,” Les Cahiers du GERAD G-2000-73. (Montreal, Canada, 2000).

F. D. Croce, A. Grosso, and F. Salassa, “A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem,” in Lecture Notes in Computer Science, Vol. 6622 (Springer, Berlin, 2011), pp. 38–47.

E. Falkenauer, “A Hybrid Grouping Genetic Algorithm for Bin Packing,” J. Heuristics 2(1), 5–30 (1996).

M. G. Ierapetritou and C. A. Floudas, “Effective Continuous-Time Formulation for Short-Term Scheduling: I. Multipurpose Batch Process,” Ind. Eng. Chem. Res. 37, 4341–4359 (1998).

S. M. Johnson, “Optimal Two- and Three-Stage Production Scheduling with Setup Time Included,” Naval Res. Logist. 1, 61–68 (1954).

Yu. Kochetov, E. Alekseeva, T. Levanova, and M. Loresh, “Large Neighborhood Local Search for the p- Median Problem,” Yugosl. J. Oper. Res. 15(1), 53–63 (2005).

Yu. Kochetov, P. Kononova, and M. Paschenko, “Formulation Space Search Approach for the Teacher/Class Timetabling Problem,” Yugosl. J. Oper. Res. 18(1), 1–11 (2008).

A. Kononov, P. Kononova, and J.-S. Hong, “Two-Stage Multimedia Scheduling Problem with an Active Prefetch Model,” in Preprints of the 13th IFAC Symposium on Information Control Problems in Manufacturing (Moscow, Russia, June 3–5, 2009) (Trapeznikov Inst. Control Sciences, Moscow, 2009), pp. 1997–2002.

A. Kononov, J.-S. Hong, P. Kononova, and F.-C. Lin, “Quantity-Based Buffer-Constrained Two Machine Flow Shop Problem: Active and Passive Prefetch Models for Multimedia Applications,” J. Sched. 15(4), 487–497 (2012).

F.-C. Lin, J.-S. Hong, and B. M. T. Lin, “A Two-Machine Flow Shop Problem with Processing Time-Dependent Buffer Constraints-an Application in Multimedia Problem,” Comput. Oper. Res. 36(4), 1158–1175 (2009).

S. Sevastianov and B.M. T. Lin, “Efficient Enumeration of Optimal and Approximate Solutions of the Two- Machine Flow Shop Problem,” in Preprint of 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (Nymburk, Czech Republic, July 19–24, 2007) (Inst. Theor. Computer Science (ITI) Charles Univ., Praha, 2011). pp. 177–179.