Complexity of a one-to-one meeting scheduling problem with two types of actors
Year of publication: |
October 2015
|
---|---|
Authors: | Le Roux, Agnès ; Bellenguez-Morineau, Odile ; Guéret, Christelle ; Prot, Damien |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 66.2015, 10, p. 1730-1741
|
Subject: | complexity theory | one-to-one meeting scheduling | NP-had in the strong sense | speed-dating | open shop | edge-colouring | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Komplexe Systeme | Complex systems | Komplexitätsmanagement | Complexity management | Konferenz | Conference |
-
Shurrab, Hafez, (2023)
-
Computer aided complexity classification of deterministic scheduling problems
Lageweg, B., (1981)
-
Single-commodity robust network design problem : complexity, instances and heuristics solutions
Álvarez-Miranda, Eduardo, (2014)
- More ...
-
A constraint-based approach for the shift design personnel task scheduling problem with equity
Lapègue, Tanguy, (2013)
-
Prot, Damien, (2013)
-
A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines
Bellenguez-Morineau, Odile, (2015)
- More ...