A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints (Q1089245)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4003885
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints |
scientific article; zbMATH DE number 4003885 |
Statements
A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints (English)
0 references
1987
0 references
The problem stated in the title is a special scheduling problem and is formulated as a linear integer programming problem. The author gives a heuristic algorithm running in polynomial time and some computational results. The definitions of the terms 'pseudo-cyclic' and 'window constraints' are somewhat complicated and cannot be repeated here; the reader must be referred to the original paper.
0 references
heuristic
0 references
polynomial time
0 references
pseudo-cyclic
0 references
window constraints
0 references
0.7537627220153809
0 references
0.7388141751289368
0 references
0.727543830871582
0 references
