Year: 2022
Type: article
Abstract: Scheduling problems can be alternately approached by methods based on discretemathematical tools. One obtains a model of a given production technology by representing therelations of the phases of production as partial ordered sets. To solve the scheduling problem insuch a case one basically needs a linear order. As an important result of the theory of partialorders we can cite the Szpilrajn theorem, stating that each partial order can be extended to alinear order. Studying the order congruences of partially ordered sets it became clear that theminimal linear order congruences can be successfully applied in investigating schedulingproblems. An algorithm for finding minimal linear order congruences is introduced, and apartition of jobs obtained which carries important information about the solution of the parallelscheduling problem.
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7220528875