Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
R. Tadei
Information about the author R. Tadei will soon be added to the site.
Found
11 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A greedy-based neighborhood search approach to a nurse rostering problem
2004
A practical nurse rostering problem, which arises at a ward of an Italian hospital, is...
Solving the Hub location problem in telecommunication network design: A local search approach
2004
This article deals with a Hub Location Problem arising in Telecommunication Network...
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
2004
Based on the work by Congram, Potts and Van de Velde, we develop for the...
Recovering beam search: enhancing the beam search approach for combinatorial optimization problems
2004
A hybrid heuristic method for combinatorial optimization problems is proposed that...
A heuristic algorithm for the auto-carrier transportation problem
2002
The delivery of vehicles to dealers is one of the major tasks in the vehicle...
A new decomposition approach for the single machine total tardiness scheduling problem
1998
This paper deals with the single machine total tardiness problem. From Emmons' basic...
The two-machine total completion time flow shop problem
1996
In this paper we study the NP-hard scheduling problem of minimizing total completion...
Aggregate planning and scheduling in the food industry: A case study
1995
In this work we introduce a production scheduling problem encountered in COMPAL S.A.,...
Advanced search techniques for the job shop problem: A comparison
1995
Recently several new heuristic search techniques have been used in machine scheduling....
Cellular control of manufacturing systems
1993
The scope of this paper is twofold. Firstly the authors propose augmented...
Solving a real world project scheduling problem with a genetic approach
1993
This work is related to a project scheduling problem encountered in the Technical...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers