Wyniki wyszukiwania - BazTech

1

Fast truck-packing of 3D boxes

Józefowska J., Pawlak G., Pesch E., Morze M., Kowalski D.

Engineering Management in Production and Services

|

2018

|

Vol. 10, no. 2

29--40

EN

We present formulation and heuristic solution of a container packing problem observed in a household equipment factory’s sales and logistics department. The main feature of the presented MIP model is combining several types of constraints following from the considered application field. The developed best-fit heuristic is tested on the basis of a computational experiment. The obtained results show that the heuristic is capable of constructing good solutions in a very short time. Moreover, the approach allows easy adjustment to additional loading constraints.

2

Prerequisites for the modelling of empty container supply chains

Kuźmicz K. A., Pesch E.

Engineering Management in Production and Services

|

2017

|

Vol. 9, no. 3

28--36

EN

Containerisation of freight transport significantly facilitates the flow of traded goods between remote destinations. The most important container transport routes link Asia with North America and Europe. The seasonality and imbalance of trade are the main factors giving rise to problems related to empty container repositioning. The aim of this paper is to develop a concept of empty container supply chains and formulate prerequisites for its modelling in the search for the optimal solution with the help of linear programming and mixed integer programming methods. This paper indicates causes of the empty container relocation problem based on the literature analysis with a special focus on the Eurasian transportation route. Also, it provides a concept of empty container supply chain, prerequisites for its modelling and examples of container supply chains modelling presented in the literature. The main results of the paper include conceptualisation of an empty container supply chain and suggested modelling prerequisites. The paper contributes to research in the field of supply chain management and optimisation of transportation.

3

Competitive location under proportional choice: 1-suboptimal points on networks

Kress D., Pesch E.

Decision Making in Manufacturing and Services

|

2012

|

Vol. 6, no. 1-2

53--64

EN

This paper is concerned with a competitive or voting location problem on networks under a proportional choice rule that has previously been introduced by Bauer et al. (1993). We refine a discretization result of the authors by proving convexity and concavity properties of related expected payoff functions. Furthermore, we answer the long time open question whether 1-suboptimal points are always vertices by providing a counterexample on a tree network.

4

A Note on Disjunctive Graph Representation

Błażewicz J., Pesch E., Sterna M.

Bulletin of the Polish Academy of Sciences. Technical Sciences

|

1999

|

Vol. 47, nr 1

103-114

EN

The paper is concerned with a new time and memory efficient representation of a disjunctive graph. The disjunctive graph is a popular model used for describing instances of the job shop scheduling problem. The proposed data structure has the form of a graph matrix and combines advantages of a few classical graph representations.

5

Nowa reprezentacja maszynowa grafu dysjunkcyjnego dla problemu szeregowania w ogólnym systemie obsługi

Błażewicz J., Pesch E., Sterna M.

Zeszyty Naukowe. Automatyka / Politechnika Śląska

|

1998

|

z. 123

45-54

PL

W pracy przedstawiono nową reprezentację maszynową grafu dysjunkcyjnego dla problemu szeregowania w ogólnym systemie obsługi - macierz grafu, charakteryzującą się korzystną złożonością pamięciową i wysoką efektywnością czasową procedur ją obsługujących. Łączy ona zalety trzech klasycznych reprezentacji struktur grafowych: macierzy sąsiedztwa, listy poprzedników i listy następników, umożliwiając łatwy dostęp do różnego rodzaju informacji opisujących operacje w ogólnym systemie obsługi.

EN

This paper is concerned with a new time and memory efficient representation of the disjunctive graph - the graph matrix, used for describing instances of the job shop scheduling problem. The proposed data structure combines advantages of the classical graph representations like a neighborhood matrix and predecessors' and successors' lists delivering combined information on a job shop and enabling easy manipulation of the problem data.