New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria

In this paper, we are interested in parallel identical machine scheduling problems with preemption and release dates in case of a regular criterion to be minimized. We show that solutions having a permutation flow shop structure are dominant if there exists an optimal solution with completion times scheduled in the same order as the release dates, or if there is no release date. We also prove that, for a subclass of these problems, the completion times of all jobs can be ordered in an optimal solution. Using these two results, we provide new results on polynomially solvable problems and hence refine the boundary between P and NP for these problems

Recovering Beam Search Approach for the Multi-Skill Project Scheduling Problem

International audienc

Using Multi-attribute Combinatorial Auctions for Resource Allocation

Publicat dins del llibre d'actes del congrés: Müller, J. P., Weyrich, Michael, Bazzan, Ana L.C. (Eds.) (2014). 'Multiagent System Technologies : 12th German Conference, MATES 2014, Stuttgart, Germany, September 23-25, 2014 : Proceedings'Social concerns about the environment and global warming suggest that industries must focus on reducing energy consumption, due to its social impact and changing laws. Furthermore, the smart grid will bring time-dependent tariffs that pose new challenges to the optimisation of resource allocation. In this paper we address the problem of optimising energy consumption in manufacturing processes by means of multi-attribute combinatorial auctions, so that resource price, delivery time, and energy consumed (and therefore environmental impact) are minimised. The proposed mechanism is tested with simulated data based on real examples, showing the impact of incorporating energy into task allocation problems. It is then compared with a sequential auction metho

Scheduling technicians and tasks in a telecommunications company

This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a large telecommunications company. This problem was solved within the framework of the 2007 challenge set up by the French Operational Research Society (ROADEF). The paper describes the authors ’ entry in the competition which tied for second place