Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Irina N. Lushchakova"'
Autor:
Irina N. Lushchakova
Publikováno v:
European Journal of Operational Research. 219:27-33
We consider the problem of preemptive scheduling n jobs on two uniform parallel machines. All jobs have equal processing requirements. For each job we are given its due date. The objective is to find a schedule minimizing total tardiness ∑ T i . We
Publikováno v:
European Journal of Operational Research. 200:334-346
The paper studies the problem of scheduling tasks on two machines to minimize the makespan. The tasks are assigned to the machine in advance. An incompatibility relation is defined over the tasks which forbids any two incompatible tasks to be process
Publikováno v:
Naval Research Logistics (NRL). 56:1-18
We consider the two-machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find
Autor:
Irina N. Lushchakova
Publikováno v:
Discrete Optimization. (4):446-460
We consider a problem of scheduling n jobs on two uniform parallel machines. For each job we are given its release date when the job becomes available for processing. All jobs have equal processing requirements. Preemptions are allowed. The objective