Yakov M. Shafransky

Learn More
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding(More)
The problem of scheduling a set of unit-time jobs on M uniform machines is studied. Some jobs may require a unit of an additional single resource during their execution. The resource is renewable but the total resource consumption is limited by the same value at each time instant. The objective is to find a feasible schedule minimizing the maximum job(More)
Multicriteria sequencing problems with criteria ordered according to their importance are considered. Additional precedence and group technology constraints are imposed. We introduce a notion of a priority-generating vector function and suggest general techniques that form a base for the construction of polynomial time algorithms for numerous sequencing(More)
The well-known O(n2) minmax cost algorithm of Lawler (Manag Sci 19(5):544–546, 1973)was developed tominimize themaximum cost of jobs processed by a single machine under precedence constraints. We first develop a fast updating algorithm to obtain optimal solutions for two neighboring instances. This method will be used throughout this article. Then we(More)