We introduce and motivate several variants of the bin packing problem where bins are assigned to time slots, minimum maximum lags required between some pairs items. suggest two integer programming formulations for general problem: a compact one stronger formulation with an exponential number variables constraints. propose branch-cut-and-price approach that exploits latter formulation. For this ...

Wave-equation migration velocity analysis (WEMVA) is an image-domain velocity model building technique based on band-limited wave propagation and designed especially for complex subsurface environments. It exploits the coherency of reflection events measured in extended images produced by a cross-correlation imaging condition with non-zero lags. Conventional approaches use either space-lags or ...

In this letter, a two-step learning scheme for the optimal selection of time lags is proposed for a typical temporal blind source separation (TBSS), Temporal Decorrelation source SEParation algorithm (abbreviated as TDSEP). Given the time lags, the time-delayed second-order correlation matrices are first diagonalized simultaneously. Then, a genetic algorithm is used to update the time lags. Fin...

in this study, we present a mrcpsp/max (multi-mode resource-constrained project scheduling problem with minimum and maximum time lags) model with minimization tardiness costs and maximization earliness rewards of activities as objective. the proposed model is nearby to real-world problems and has wide applications in various projects. this problem is not available in the literature exactly and ...