4OR

http://link.springer.com/journal/10288

List of Papers (Total 15)

Competitive multi-agent scheduling with an iterative selection rule

In this work we address a class of deterministic scheduling problems in which k agents compete for the usage of a single machine. The agents have their own objective functions and submit their tasks in successive steps to an external coordination subject, who sequences them by selecting the shortest task in each step. We look at the problem in two different settings and consider ...

Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes

In this paper we propose the integration of column generation in the revised normal boundary intersection (RNBI) approach to compute a representative set of non-dominated points for multi-objective linear programmes (MOLPs). The RNBI approach solves single objective linear programmes, the RNBI subproblems, to project a set of evenly distributed reference points to the non-dominated ...

A brand new cheating attempt: a case of usurped identity

We recall some cases of ethical misconduct that occurred in the recent years, and we report a new trick that was recently attempted to cheat the journal in order to obtain the publication of an article through usurped identity.

The dirty dozen of 4OR

This is the traditional triennial note used by the Editors to give the readers of 4OR information on the state of the journal and its future. In the three years that have passed since the last editorial note (Liberti et al. in 4OR 10(1):1–13, 2012), three volumes (each containing four issues) of the journal have been published: vol. 10 (2012), vol. 11 (2013) and vol. 12 (2014).

Internet shopping with price sensitive discounts

A customer would like to buy a given set of products in a given set of Internet shops. For each Internet shop, standard prices for the products are known as well as a concave increasing discounting function of total standard and delivery price. The problem is to buy all the required products at the minimum total discounted price. Computational complexity of various special cases is ...

Soft due window assignment and scheduling of unit-time jobs on parallel machines

We study problems of scheduling n unit-time jobs on m identical parallel machines, in which a common due window has to be assigned to all jobs. If a job is completed within the due window, then no scheduling cost incurs. Otherwise, a job-dependent earliness or tardiness cost incurs. The job completion times, the due window location and the size are integer valued decision ...

No end of the world in 2012 for 4OR

The purpose of this note is to give the readers of 4OR information on the state of the journal and its future, abiding by a triennial tradition which started with Bouyssou et al. (4OR 1(1):1–6, 2003) and continued with Bouyssou et al. (4OR 4(1):1–9, 2006) and Bouyssou et al. (4OR Q J Oper Res 7(1):15, 2009). In the 3 years that have passed since the last editorial note, three ...

On the complexity of a bundle pricing problem

We consider the problem of pricing items in order to maximize the revenue obtainable from a set of single minded customers. We relate the tractability of the problem to structural properties of customers’ valuations: the problem admits an efficient approximation algorithm, parameterized along the inhomogeneity of the valuations.

Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem

The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.