The variable neighborhood search for the two machine flow shop problem with a passive prefetch
- 1 January 2013
- journal article
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 7 (1) , 54-67
Abstract
We consider the two machine flow shop scheduling problem with passive loading of the buffer on the second machine. To compute lower bounds for the global optimum, we present four integer linear programming formulations of the problem. Three local search methods with variable neighborhoods are developed for obtaining upper bounds. Some new large neighborhood is designed. Our methods use this neighborhood along with some other well-known neighborhoods. For computational experiments, we present a new class of test instances with known global optima. Computational results indicate a high efficiency of the proposed approach for the new class of instances as well as for other classes of instances of the problem.Keywords
This publication has 9 references indexed in Scilit:
- Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applicationsJournal of Scheduling, 2011
- A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem2011
- A two-machine flowshop problem with processing time-dependent buffer constraints—An application in multimedia presentationsComputers & Operations Research, 2009
- Two-stage multimedia scheduling problem with an active prefetch modelIFAC Proceedings Volumes, 2009
- Formulation space search approach for the teacher/class timetabling problem2008
- Large neighborhood local search for the p-median problem2005
- Effective Continuous-Time Formulation for Short-Term Scheduling. 1. Multipurpose Batch ProcessesIndustrial & Engineering Chemistry Research, 1998
- A hybrid grouping genetic algorithm for bin packingJournal of Heuristics, 1996
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954