No abstract

No abstract

Abstract.We consider the open shop scheduling problem with uncertain durations modelled as fuzzy numbers. We define the concepts of necessary and possible β-robustness of schedules and set as our goal to maximise them. Additionally, we propose to assess solution robustness by means of Monte Carlo simulations. Experimental results using a genetic algorithm illustrate the proposals.

Abstract. In the sequel, we tackle a real-world problem: forming examination boards for the university-entrance exams at the autonomous region of Asturias (Spain). We formulate the problem, propose a heuristic GRASP-like method to solve it and show some experimental results to support our proposal.