Search results for "Natalia V. Shakhlevich"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Peter Brucker, Natalia V. Shakhlevich	A polynomial-time algorithm for a flow-shop batching problem with equal-length operations.	J. Scheduling	2011	DBLP DOI BibTeX RDF
1	Peter Brucker, Natalia V. Shakhlevich	Inverse scheduling: two-machine flow-shop problem.	J. Scheduling	2011	DBLP DOI BibTeX RDF
1	Alessandro Condotta, Sigrid Knust, Natalia V. Shakhlevich	Parallel batch scheduling of equal-length jobs with release and due dates.	J. Scheduling	2010	DBLP DOI BibTeX RDF
1	Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich	Single Machine Scheduling with Controllable Processing Times by submodular Optimization.	Int. J. Found. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Peter Brucker, Natalia V. Shakhlevich	Inverse scheduling with maximum lateness objective.	J. Scheduling	2009	DBLP DOI BibTeX RDF	Single-machine scheduling, Maximum lateness, Inverse optimization
1	Natalia V. Shakhlevich, Vitaly A. Strusevich	Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times.	Algorithmica	2008	DBLP DOI BibTeX RDF	Uniform parallel machine scheduling, Generalized polymatroid, Maximum flow, Controllable processing times
1	Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich	Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach.	ESA	2008	DBLP DOI BibTeX RDF
1	T. C. Edwin Cheng, Natalia V. Shakhlevich	Two-machine open shop problem with controllable processing times.	Discrete Optimization	2007	DBLP DOI BibTeX RDF
1	T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich	Scheduling with controllable release dates and processing times: Total completion time minimization.	European Journal of Operational Research	2006	DBLP DOI BibTeX RDF
1	T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich	Scheduling with controllable release dates and processing times: Makespan minimization.	European Journal of Operational Research	2006	DBLP DOI BibTeX RDF
1	Natalia V. Shakhlevich, Vitaly A. Strusevich	Single machine scheduling with controllable release and processing parameters.	Discrete Applied Mathematics	2006	DBLP DOI BibTeX RDF
1	T. C. Edwin Cheng, Natalia V. Shakhlevich	Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem.	European Journal of Operational Research	2005	DBLP DOI BibTeX RDF
1	Natalia V. Shakhlevich	Open shop unit-time scheduling problems with symmetric objective functions.	4OR	2005	DBLP DOI BibTeX RDF	Open shop scheduling, symmetric function, parallel machine scheduling
1	Natalia V. Shakhlevich, Vitaly A. Strusevich	Pre-Emptive Scheduling Problems with Controllable Processing Times.	J. Scheduling	2005	DBLP DOI BibTeX RDF	bicriteria problems, greedy algorithms, single machine scheduling, parallel machine scheduling, polymatroids, controllable processing times
1	Peter Brucker, Sigrid Knust, T. C. Edwin Cheng, Natalia V. Shakhlevich	Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays.	Annals OR	2004	DBLP DOI BibTeX RDF	transportation delays, shop problems, scheduling, time-lags, complexity results
1	T. C. Edwin Cheng, Zhi-Long Chen, Natalia V. Shakhlevich	Common due date assignment and scheduling with ready times.	Computers & OR	2002	DBLP DOI BibTeX RDF
1	Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner	Complexity of mixed shop scheduling problems: A survey.	European Journal of Operational Research	2000	DBLP DOI BibTeX RDF
1	Yuri N. Sotskov, Natalia V. Shakhlevich	NP-hardness of Shop-scheduling Problems with Three Jobs.	Discrete Applied Mathematics	1995	DBLP DOI BibTeX RDF
1	Natalia V. Shakhlevich, Yuri N. Sotskov	Scheduling two jobs with fixed and nonfixed routes.	Computing	1994	DBLP DOI BibTeX RDF

Publications of "Natalia V. Shakhlevich" ( http://dblp.L3S.de/Authors/Natalia_V._Shakhlevich )