In this paper we consider the following problem: a Company wants to sell consecutive time slots on a single machine. It wants to maximize the revenues, whereby market prizes are not known. Additionally, consider a number of potential buyers of those time slots providing each at least one job....

In the generalized balanced optimization problem (GBaOP) the objective value $${\max_{e \in S}{|c(e)-k\max(S)|}}$$ is minimized over all feasible subsets S of E = {1, . . . , m}. We show that the algorithm proposed in Punnen and Aneja (Oper Res Lett 32:27–30, 2004 ) can be modified to ensure...

In the generalized balanced optimization problem (GBaOP) the objective value <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\max_{e \in S}{|c(e)-k\max(S)|}}$$</EquationSource> </InlineEquation> is minimized over all feasible subsets S of E = {1, . . . , m}. We show that the algorithm proposed in Punnen and Aneja (Oper Res Lett 32:27–30, <CitationRef CitationID="CR14">2004</CitationRef>) can be modified to...</citationref></equationsource></inlineequation>

This paper describes a tabu search approach for a multiprocessor scheduling problem, where a list of jobs has to be scheduled on identical parallel processors. Each job in the list has a release date, a due date, a processing time and a set of predecessors. The objective is to minimize the...