Scheduling under the network of temporo-spatial proximity relationships
Year of publication: |
August 2017
|
---|---|
Authors: | Kozik, Andrzej |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 84.2017, p. 106-115
|
Subject: | Scheduling | Proximity relationships | Rectangle packing problem | Sequence pair | Neighborhood evaluation | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Packproblem | Packing problem | Unternehmensnetzwerk | Business network | Algorithmus | Algorithm | Nachbarschaft | Neighbourhood |
-
A genetic algorithm for two-dimensional bin packing with due dates
Bennell, Julia A., (2013)
-
A single machine scheduling problem with two-dimensional vector packing constraints
Billaut, Jean-Charles, (2015)
-
Single batch processing machine scheduling with two-dimensional bin packing constraints
Li, Xueping, (2018)
- More ...
-
New perspectives in VLSI design automation: deterministic packing by Sequence Pair
Janiak, Adam, (2010)
-
New perspectives in VLSI design automation : deterministic packing by Sequence Pair
Janiak, Adam, (2010)
- More ...