Treffer: License class design: complexity and algorithms
Title:
License class design: complexity and algorithms
Authors:
Source:
European journal of operational research. 63(3):432-444
Publisher Information:
Amsterdam: Elsevier, 1992.
Publication Year:
1992
Physical Description:
print, 16 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Ordonnancement, Scheduling, sequencing, Algorithme, Algorithm, Algoritmo, Aéronef, Aircraft, Aeronave, Aéroport, Airport, Aeropuerto, Capacité, Capacity, Capacidad, Complexité calcul, Computing complexity, Complejidad cálculo, Maintenance, Mantenimiento, Ordonnancement, Scheduling, Ordonamiento, Planification, Planning, Planificación, Programmation linéaire, Linear programming, Programación lineal, Réseau, Network, Red, Fixed job interval, Flot réseau, Network flow
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. Limburg, 6200 MD Maastricht, Netherlands
ISSN:
0377-2217
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.4459653
Database:
PASCAL Archive
Weitere Informationen
In this paper a generalization of the Fixed Job Scheduling Problem (FSP) is considered, which appears in the aircraft maintenance process at an airport. A number of jobs have to be carried out, where the main attributes of a job are a fixed start time, a fixed finish time and an aircraft type. For carrying out these jobs a number of engineers are available. An engineer is allowed to carry out a specific job only if he has a license for the corresponding aircraft type. Furthermore, the jobs must be carried out in a non-preemptive way and each engineer can be carrying out at most one job at the same time.