Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 10 / 10
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Mitigating supply chain disruptions in plywood manufacturing by deadline reordering
Olivér Ősz, József Garab, Máté Hegyháti, Balázs Dávid, 2026, izvirni znanstveni članek

Opis: Disruptions in supply networks have caused many logistical and planning challenges in the last few years. The previous predictability of the shipping times of raw materials changed drastically due to various global issues, which affected many production areas, including the wood industry. This work is motivated by a case study of a Central European plywood production facility, where supply-side disruptions caused difficulties in meeting deadlines for downstream companies of the construction and furniture industry. As a result, the objective of production planners shifted towards mitigating the financial burden caused by cancellation penalties. Three MILP (Mixed-Integer Linear Programming) models and a genetic algorithm were developed to tackle the scheduling of a plywood production plant with raw material shipments and order deadlines. The novelty of the considered problem lies in the flexibility of swapping order deadlines from the same client, which was inspired by the real-life deals of the aforementioned company. The methods were tested on 120 benchmark instances of different sizes generated from real industrial data. The genetic algorithm terminated within 60 s for all instances and found the optimal or best-known solution in 71 of 80 short-horizon instances, while also remaining efficient on larger 30-day cases. As the solution approach is not specific to plywood production, it can be applied to scheduling problems in other fields as well, where similar disruptions can develop, and the production process features are covered by the Multi-Mode Resource-Constrained Project Scheduling Problem class.
Ključne besede: plywood, scheduling, MRCPSP, MILP, genetic algorithm
Objavljeno v RUP: 01.06.2026; Ogledov: 86; Prenosov: 5
.pdf Celotno besedilo (1,52 MB)
Gradivo ima več datotek! Več...

2.
3.
An assignment model for scheduling vehicles with refueling
Viktor Árgilán, János Balogh, Jozsef Bekesi, Balázs Dávid, Gábor Galambos, Miklós Ferenz Krész, Attila Tóth, 2025, izvirni znanstveni članek

Opis: The vehicle scheduling problem consists of scheduling a fleet of vehicles to cover a set of tasks at a minimum cost. The tasks are given in predetermined time intervals, and the vehicles are supplied by different depots. There are several known mathematical models that can be used to solve this problem, resulting in a valid vehicle schedule. One such approach is the multi-commodity network flow model, where the optimal schedule is computed by solving a linear integer programming problem. The main disadvantage of this model is that it can be intractable for practical scenarios that include additional vehicle constraints. These are specific restrictions that come from real-world applications, such as the refueling requirement of vehicles. When vehicles of different fuel types, including environmentally friendly ones, are considered, decisions about their refueling include many additional constraints that a valid assignment must meet. This paper presents how these vehicle-specific tasks can be included in the vehicle assignment phase. An IP-based heuristic solution is given for this specific variant of the vehicle assignment with multiple depots. Computational results on real-life and randomly generated test instances are presented where the vehicle assignment model uses an input schedule generated by the time-space network approach. The resulting integer programming problem for this assignment can be solved extremely quickly, even with a large number of variables. Computational results demonstrate that the model can effectively extend the capabilities of the standard models to be able to handle the assignment with vehicle-specific task requirements.
Ključne besede: vehicle scheduling, vehicle assignment, refueling constraints, fuel types, IP based solution
Objavljeno v RUP: 25.07.2025; Ogledov: 1400; Prenosov: 3
.pdf Celotno besedilo (427,48 KB)

4.
Scheduling truck arrivals for efficient container flow management in port logistics
Daniil Baldouski, Miklós Ferenz Krész, Balázs Dávid, 2025, izvirni znanstveni članek

Opis: The management of truck arrivals at container terminals is crucial for efficient port operations. Congestions developing both outside and inside the gates can cause logistical problems, while also having a significant impact on the environment and the surroundings of the port. Therefore, optimizing truck queues outside the gates of the port, as well as routing of trucks inside the terminals can lead to an improve- ment in the overall efficiency of the port processes. This paper presents a mixed- integer linear programming formulation to determine these optimal truck routes and schedules. The model considers a port with an external parking lot, multiple gates, internal roadways, and docks. A rolling horizon heuristic is also developed for the solution of instances where the model is otherwise intractable. The developed meth- ods are evaluated on instances simulated based on real-world data.
Ključne besede: scheduling, port logistics, container flow optimization, simulation, mixed-integer linear programming
Objavljeno v RUP: 04.07.2025; Ogledov: 1605; Prenosov: 7
.pdf Celotno besedilo (1,98 MB)
Gradivo ima več datotek! Več...

5.
6.
7.
8.
9.
10.
A two-stage heuristic for the university course timetabling problem
Máté Pintér, Balázs Dávid, 2019, objavljeni znanstveni prispevek na konferenci

Ključne besede: university course timetabling, local search, heuristic
Objavljeno v RUP: 14.11.2019; Ogledov: 3479; Prenosov: 398
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.03 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici