Y. Shafransky

Available identifiers

Publication	Date of Publication	Type
On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty	2020-12-11	Paper
Minimizing maximum cost for a single machine under uncertainty of processing times	2020-05-27	Paper
Lawler's minmax cost problem under uncertainty	2017-10-17	Paper
An alternative approach for proving the NP-hardness of optimization problems	2016-10-07	Paper
Lawler's minmax cost algorithm: optimality conditions and uncertainty	2016-09-07	Paper
Batch scheduling with deadlines on parallel machines: an NP-hard case	2016-05-26	Paper
Scheduling dedicated jobs with variative processing times	2016-02-23	Paper
Minimizing maximum weight of subsets of a maximum matching in a bipartite graph	2015-09-30	Paper
https://portal.mardi4nfdi.de/entity/Q3416602	2007-01-22	Paper
An optimization algorithm for the clearing of interbank payments	2006-03-22	Paper
A note on the complexity of family scheduling to minimize the number of late jobs	2001-10-14	Paper
Sequencing with ordered criteria, precedence and group technology constraints	2001-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q2712372	2001-07-02	Paper
Scheduling for parallel dedicated machines with a single server	2000-07-09	Paper
Batch scheduling with deadlines on parallel machines	1999-03-07	Paper
Uniform machine scheduling of unit-time jobs subject to resource constraints	1998-07-28	Paper

This page was built for person: Y. Shafransky