Shakhlevich Natalia V.

Natalia V. Shakhlevich

Information about the author Natalia V. Shakhlevich will soon be added to the site.
Found 9 papers in total
Scheduling with controllable release dates and processing times: Makespan minimization
Scheduling with controllable release dates and processing times: Makespan minimization
2006
The paper deals with the single-machine scheduling problem in which job processing...
Scheduling with controllable release dates and processing times: Total completion time minimization
Scheduling with controllable release dates and processing times: Total completion time minimization
2006
The single machine scheduling problem with two types of controllable parameters, job...
Pre-emptive scheduling problems with controllable processing times
Pre-emptive scheduling problems with controllable processing times
2005
We consider a range of single machine and identical parallel machine pre-emptive...
Two-machine open shop problem with controllable processing times
Two-machine open shop problem with controllable processing times
2007
We consider a two-machine open shop problem in which the job processing times are...
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
2005
In this paper we study both the non-preemptive and preemptive versions of the popular...
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
2004
We consider shop problems with transportation delays where not only the jobs on the...
Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
1999
The paper deals with the determination of an optimal schedule for the so-called...
Complexity of mixed shop scheduling problems: A survey
Complexity of mixed shop scheduling problems: A survey
2000
We survey recent results on the computational complexity of mixed shop scheduling...
A heuristic decomposition algorithm for scheduling problems on mixed graphs
A heuristic decomposition algorithm for scheduling problems on mixed graphs
1995
This paper considers a scheduling problem where a set of n jobs has to be processed on...
Papers per page: