Temat: open shop - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On a bicriteria optimal production plan
Autorzy:: Kuchta, D.
Powiązania:: https://bibliotekanauki.pl/articles/970401.pdf
Data publikacji:: 2007
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: production schedule
makespan
flow shop
open shop
Opis:: The classical mathematical programming problem used for the determination of a production plan maximising total income or profit is complemented with a second objective, concerning the makespan of the products being manufactured on two machines. As a result, a bicriterial integer linear programming problem is obtained, which can be solved by means of classical methods. A computational example is presented and discussed.
Źródło:: Control and Cybernetics; 2007, 36, 2; 357-366
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Time buffers in the open shop problem
Autorzy:: Kuchta, D.
Powiązania:: https://bibliotekanauki.pl/articles/206438.pdf
Data publikacji:: 2014
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: open shop
stable schedule
schedule buffers
Opis:: A stability concept for the open shop schedule is proposed. The underlying aim is to protect an organisation against serious problems caused by accumulation of delays in various processes realised in the organisation at the same time. The stability criterion is coupled with that of schedule makespan minimisation. Buffers are used as a tool of ensuring schedule stability. A fuzzy model determining the optimal schedule with respect to both criteria is formulated based on expert opinions as to the desired buffer size and the desired planned makespan. The model is expressed as a mixed integer linear programming model. The approach is illustrated by means of an example.
Źródło:: Control and Cybernetics; 2014, 43, 4; 531-546
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: On transitive orientations of G-ê
Autorzy:: Andresen, Michael
Powiązania:: https://bibliotekanauki.pl/articles/744416.pdf
Data publikacji:: 2009
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: comparability graph
edge deletion
transitive orientation
Triangle Lemma
Γ-components
open shop scheduling
irreducibility
Opis:: A comparability graph is a graph whose edges can be oriented transitively. Given a comparability graph G = (V,E) and an arbitrary edge ê∈ E we explore the question whether the graph G-ê, obtained by removing the undirected edge ê, is a comparability graph as well. We define a new substructure of implication classes and present a complete mathematical characterization of all those edges.
Źródło:: Discussiones Mathematicae Graph Theory; 2009, 29, 3; 423-467
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja