๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A heuristic procedure for the crew rostering problem

โœ Scribed by Lucio Bianco; Maurizio Bielli; Aristide Mingozzi; Salvatore Ricciardelli; Massimo Spadoni


Book ID
107992299
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
801 KB
Volume
58
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Integrating constraint logic programming
โœ A. Caprara; F. Focacci; E. Lamma; P. Mello; M. Milano; P. Toth; D. Vigo ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 162 KB

In this paper, we investigate the possibility of integrating Artificial Intelligence (AI) and Operations Research (OR) techniques for solving the Crew Rostering Problem (CRP). CRP calls for the optimal sequencing of a given set of duties into rosters satisfying a set of constraints. The optimality c

A heuristic network procedure for the as
โœ Peter A. Pinto; David G. Dannenbring; Basheer M. Khumawala ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 417 KB

## Abstract Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally y

Hybrid Genetic Algorithms for a Rosterin
โœ A. Monfroglio ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 676 KB

Hybrid Genetic Algorithms are described for a large-size real-life rostering problem (railway workers' job scheduling and roster optimization). The new algorithm uses an order-based representation which encodes as a chromosome the list of job units to schedule. First, a greedy algorithm is considere