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

Optimal assignment of high multiplicity flight plans to dispatchers

โœ Scribed by A. Agnetis; S. Smriglio


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
154 KB
Volume
47
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper addresses the problem of finding a feasible schedule of n jobs on m parallel machines, where each job has a deadline and some jobs are preassigned to some machine. This problem arises in the daily assignment of workload to a set of flight dispatchers, and it is strongly characterized by the fact that the job lengths may assume one out of k different values, for small k. We prove the problem to be NP-complete for k = 2 and propose an effective implicit enumeration algorithm which allows efficiently solution a set of real-life instances.


๐Ÿ“œ SIMILAR VOLUMES


Time-dependent density-functional theory
โœ Xiao-Min Tong; Shih-I Chu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 263 KB ๐Ÿ‘ 2 views

We present a time-dependent density-functional theory TDDFT with ## ลฝ . ลฝ . optimized effective potential OEP and self-interaction correction SIC for nonperturbative treatment of multiphoton and nonlinear optical processes of manyelectron systems in intense laser fields. The resulting TDOEPrKLI-SI