Maciej Drwal
YOU?
Author Swipe
View article: Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times
Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times Open
We consider the robust version of single machine scheduling problem with the objective to minimize the weighted number of jobs completed after their due-dates. The jobs have uncertain processing times represented by intervals, and decision…
View article: NMRNet: a deep learning approach to automated peak picking of protein NMR spectra
NMRNet: a deep learning approach to automated peak picking of protein NMR spectra Open
Motivation Automated selection of signals in protein NMR spectra, known as peak picking, has been studied for over 20 years, nevertheless existing peak picking methods are still largely deficient. Accurate and precise automated peak pickin…
View article: Robust scheduling to minimize the weighted number of late jobs with\n interval due-date uncertainty
Robust scheduling to minimize the weighted number of late jobs with\n interval due-date uncertainty Open
We consider the class of single machine scheduling problems with the\nobjective to minimize the weighted number of late jobs, under the assumption\nthat completion due-dates are not known precisely at the time when\ndecision-maker must pro…
View article: Min-Max Regret Scheduling To Minimize the Total Weight of Late Jobs With\n Interval Uncertainty
Min-Max Regret Scheduling To Minimize the Total Weight of Late Jobs With\n Interval Uncertainty Open
We study the single machine scheduling problem with the objective to minimize\nthe total weight of late jobs. It is assumed that the processing times of jobs\nare not exactly known at the time when a complete schedule must be dispatched.\n…
View article: Optimal Design of Robust Combinatorial Mechanisms for Substitutable Goods
Optimal Design of Robust Combinatorial Mechanisms for Substitutable Goods Open
In this paper we consider multidimensional mechanism design problem for selling discrete substitutable items to a group of buyers. Previous work on this problem mostly focus on stochastic description of valuations used by the seller. Howev…
View article: Multidimensional monopolist pricing problem with uncertain valuations
Multidimensional monopolist pricing problem with uncertain valuations Open
We consider the problem of revenue maximization by a monopolist selling a set of substitutable goods to an unit-demand buyer of uncertain type. The Bayesian variant of this problem has received much interest in the computer science and eco…