This paper investigates how to adapt some discrepancy-based search methods to solve Hybrid Flow Shop (HFS) problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimises the makespan. We present here an...

This paper investigates how to adapt some discrepancy-based search methods to solve Hybrid Flow Shop (HFS) problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimises the makespan. We present here an...

Offshore petroleum industry uses helicopters to transport the employees to and from installations. Takeoff and landing represent a substantial part of the flight risks for passengers. In this paper, we propose and analyze approaches to create a safe flight schedule to perform pickup of employees...

Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some function of the job completion times. If preemption is not allowed, then most problems are not only NP-hard, but also very hard from a practical point of view. In this paper, we show that strong...

In this paper we introduce the concept of online tradeoff scheduling to minimize two objective functions f1 and f2 simultaneously. An online algorithm A is called (ρ1,ρ2)-competitive for minimizing f1 and f2 if A is ρ1-competitive for minimizing f1 and ρ2-competitive for minimizing f2. A...

How should scholarships be distributed among the (public) higher education students? We raise this situation as a redistribution problem. Following the approach developed in Fleurbaey (1994) and Bossert (1995), redistribution should be based on the notion of solidarity and it reallocates...

The idea of ensuring a guarantee (a minimum amount of the resources) to each agent has recently acquired great relevance, in both social and political terms. Furthermore, the notion of Solidarity has been treated frequently in redistribution problems to establish that any increment of the...

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is of crucial importance to have good and easy bounds for an...

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is of crucial importance to have good and easy bounds for an...