Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 6.

Article

Knust, S, Shakhlevitch, NV orcid.org/0000-0002-5225-4008, Waldherr, S et al. (1 more author) (2019) Shop Scheduling Problems with Pliable Jobs. Journal of Scheduling. ISSN 1094-6136

Weiß, C, Waldherr, S, Knust, S et al. (1 more author) (2017) Open Shop Scheduling with Synchronization. Journal of Scheduling, 20 (6). pp. 557-581. ISSN 1094-6136

Weiß, C, Knust, S, Shakhlevitch, NV et al. (1 more author) (2016) The Assignment Problem with Nearly Monge Arrays and Incompatible Partner Indices. Discrete Applied Mathematics, 211. pp. 183-203. ISSN 0166-218X

Bruns, F, Knust, S and Chakhlevitch, N (2016) Complexity results for storage loading problems with stacking constraints. European Journal of Operational Research, 249 (3). pp. 1074-1081. ISSN 0377-2217

Condotta, A, Knust, S, Meier, D et al. (1 more author) (2012) Tabu search and lower bounds for a combined production-transportation problem. Computers and Operations Research, 40 (3). 886 - 900. ISSN 0305-0548

Proceedings Paper

Weiß, C, Knust, S, Shakhlevich, NV et al. (1 more author) (2015) On the assignment problem with a nearly Monge matrix and its applications in scheduling. In: Marchetti-Spaccamela, A, Crama, Y, Goossens, D, Leus, R, Schyn, M and Schyns, F, (eds.) Proceedings of the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems. MAPS 2015, 08-12 Jun 2015, La Roche-en-Ardenne, Belgium. KULeuven Faculty of Business and Economics , pp. 202-204. ISBN 9789081409971

This list was generated on Mon Oct 14 00:51:14 2019 BST.