One-pass batching algorithms for the one-machine problem

An Exponential Neighborhood for a One-Machine Batching Problem

In this paper we will consider a one-machine batching problem which is a combination of a sequencing and a partitioning problem. We will develop an exponential neighborhood for this problem which can be evaluated in quadratic time using shortest path calculations. Results of a computational study are reported.

Eecient Calculation of a Best Neighbor for a One Machine Batching Problem

In this paper we will consider a one machine batching problem which is a combination of a sequencing and a partitioning problem. Since for a xed sequence an eecient method for calculating the best partition of this sequence into batches is known, local search may be applied by considering as solutions sequences and as objective value of a sequence the value of the best partition of this sequenc...

Sgp Heuristics for One Machine Scheduling Problem

Each of N jobs is to be processed on a single machine. Only one job can be processed at any given time. Each switch from one job to another requires sequence dependent setup time. The objective is to find a processing order which minimizes the makespan. Let call this problem the OMSC problem. OMSC problem is defined as a grouping problem. A heuristics called SGP Heuristics and based on spectral...

One-Pass Algorithms for Some Generalized Network Problems

A Non-convex One-Pass Framework for Generalized Factorization Machine and Rank-One Matrix Sensing

We develop an efficient alternating framework for learning a generalized version of Factorization Machine (gFM) on steaming data with provable guarantees. When the instances are sampled from d dimensional random Gaussian vectors and the target second order coefficient matrix in gFM is of rank k, our algorithm converges linearly, achieves O( ) recovery error after retrieving O(kd log(1/ )) train...