We consider several parallel machine scheduling settings with the objective to minimize the schedule makespan. The most general of these settings is unrelated parallel machine scheduling. We assume that, in addition to its machine dependence, the processing time of any job is dependent on the...

We consider the problem to price (digital) items in order to maximize the revenue obtainable from a set of bidders. We suggest a natural monotonicity constraint on bundle prices, show that the problem remains NP-hard, and we derive a PTAS. We also discuss a special case, the highway pricing problem.

We consider machine scheduling problems where jobs have to be processed on unrelated parallel machines in order to minimize the schedule makespan. The processing time of any job is dependent on the usage of a scarce resource that can be distributed over the jobs in process. The more of that...