European Chapter on Combinatorial Optimization (ECCO 2009)

Иер. : 2009.

Главы книги

An Algorithm for Total Weighted Completion Time Minimization in Preemptive Equal Job Length With Release Dates on a Single Machine

Кварацхелия А. Г., Лазарев А. А., , in: European Chapter on Combinatorial Optimization (ECCO 2009).: Jerusalem: [б.и.], 2009. P. 13–14.

We consider the minimizing total weighted completion time in preemptive equal job length scheduling problem on a single machine with release dates. We propose a polynomial time algorithm that solves the problem. Before this paper, the problem is known to be open. ...

Добавлено: 4 марта 2013 г.

An Approximate Method for Solving Scheduling Problems

Лазарев А. А., , in: European Chapter on Combinatorial Optimization (ECCO 2009).: Jerusalem: [б.и.], 2009. P. 23–23.

We consider the scheduling problems α|β|Fmax: A set of n jobs J1,…,Jn with release dates r1,…,rn, processing times p1,…,pn and due dates d1,…,dn has to be scheduled on a single or many machines. The job preemption is not allowed. The goal is to find aschedule that minimizes the regular function F(C1,…,Cn), that Cj is the ...

Добавлено: 4 марта 2013 г.

An Approximation Method for Estimating Optimal Value of Minimizing Scheduling Problems

Лазарев А. А., , in: European Chapter on Combinatorial Optimization (ECCO 2009).: Jerusalem: [б.и.], 2009. P. 13–13.

In this paper, for $NP$-hardness single and multi-machine scheduling problems with the criterion of minimization maximum lateness the metrics $\rho$ has been used. We consider some approaches finding of the approximate solution for the problems. The idea of approaches consists in construction to a initial instance $A$ such instance $B$ (with the same number of ...

Добавлено: 4 марта 2013 г.