On a special scheduling problem of posets
Author
Source
The Arabian Journal for Science and Engineering
Issue
Vol. 17, Issue 3 (31 Jul. 1992), pp.403-406, 4 p.
Publisher
King Fahd University of Petroleum and Minerals
Publication Date
1992-07-31
Country of Publication
Saudi Arabia
No. of Pages
4
Main Subjects
Information Technology and Computer Science
Abstract EN
Given a finite ordered set p.
Find a linear extension of p which preserves a minimum number of covering relations of p.
This article mainly concentrates on this problem, called the bump number problem.
In particular we present some new results concerning the “greedy” ordered sets; these are the ordered sets for which the “greedy algorithm” always produces an optimal solution.
American Psychological Association (APA)
Zaguia, Najib. 1992. On a special scheduling problem of posets. The Arabian Journal for Science and Engineering،Vol. 17, no. 3, pp.403-406.
https://search.emarefa.net/detail/BIM-598424
Modern Language Association (MLA)
Zaguia, Najib. On a special scheduling problem of posets. The Arabian Journal for Science and Engineering Vol. 17, no. 3 (Jul. 1992), pp.403-406.
https://search.emarefa.net/detail/BIM-598424
American Medical Association (AMA)
Zaguia, Najib. On a special scheduling problem of posets. The Arabian Journal for Science and Engineering. 1992. Vol. 17, no. 3, pp.403-406.
https://search.emarefa.net/detail/BIM-598424
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 406
Record ID
BIM-598424
