Search
Search results for: COMBINATORIAL OPTIMIZATION DIVISIBLE JOBS SHARED PROCESSORS SUBCONTRACTING SUPPLY CHAINS
-
Shared multi-processor scheduling
PublicationWe study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job’s completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in supply chains and divisible load scheduling in computing. We show that synchronized...
-
Shared processor scheduling of multiprocessor jobs
PublicationWe study a problem of shared processor scheduling of multiprocessor weighted jobs. Each job can be executed on its private processor and simultaneously on possibly many processors shared by all jobs. This simultaneous execution reduces their completion times due to the processing time overlap. Each of the m shared processors may charge a different fee but otherwise the processors are identical. The goal is to maximize the total...
-
Multiple Criteria Optimization for Supply Chains – Analysis of Case Study
Publication -
JOURNAL OF COMBINATORIAL OPTIMIZATION
Journals -
ROLE OF GREEN LOGISTICS IN THE CONSTRUCTION OF SUSTAINABLE SUPPLY CHAINS
PublicationThe global supply chain has been growing strongly in recent years. This development brings many benefits to the economy, society, and human resources in each country but also causes a large number of concerns related to the environment since traditional logistics activities in the supply chain have been releasing significant amount of emissions. For that reason, many solutions have been proposed to deal with these environmental...
-
Aleksandra Parteka dr hab. inż.
PeopleAbout me: I am an associate professor and head of doctoral studies at the Faculty of Management and Economics, Gdansk University of Technology (GdanskTech, Poland). I got my MSc degree in Economics from Gdansk University of Technology (2003) and Universita’ Politecnica delle Marche (2005), as well as MA degree in Contemporary European Studies from Sussex University (2006, with distinction). I received my PhD in Economics...
-
Extended Hopfield models of neural networks for combinatorial multiobjective optimization problems
Publication -
Selected Multiple Criteria Supply Chain Optimization Problems
Publication -
International Journal of Combinatorial Optimization Problems and Informatics
Journals -
Multicriteria Optimization Approach to Design and Operation of District Heating Supply System over its Life Cycle
PublicationDistrict Heating (DH) systems are commonly supplied using local heat sources. Nowadays, modern insulation materials allow for effective and economically viable heat transportation over long distances (over 20 km). In the paper a method for optimized selection of design and operating parameters of long distance Heat Transportation System (HTS) is proposed. The method allows for evaluation of feasibility and effectivity of heat transportation...
-
Space Mission Risk, Sustainability and Supply Chain: Review, Multi-Objective Optimization Model and Practical Approach
Publication -
Kamila Kokot-Kanikuła mgr
PeopleKamila Kokot-Kanikuła is a digital media senior librarian at Gdańsk University of Technology (GUT) Library. She works in Digital Archive and Multimedia Creation Department and her main areas of interests include early printed books, digital libraries, Open Access and Open Science. In the Pomeranian Digital Library (PDL) Project she is responsible for creating annual digital plans, transferring files on digital platform, and promoting...
-
Shared processor scheduling
PublicationWe study the shared processor scheduling problem with a single shared processor to maximize total weighted overlap, where an overlap for a job is the amount of time it is processed on its private and shared processor in parallel. A polynomial-time optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an (log)-time optimization algorithm for a class...
-
On-Line Partitioning for On-Line Scheduling with Resource Conflicts
PublicationWithin this paper, we consider the problem of on-line partitioning the sequence of jobs which are competing for non-sharable resources. As a result of partitioning we get the subsets of jobs that form separate instances of the on-line scheduling problem. The objective is to generate a partition into the minimum number of instances such that the response time of any job in each instance is bounded by a given constant. Our research...
-
European Chapter on Combinatorial Optimization
Conferences -
Conference on Combinatorial Optimization and Applications
Conferences -
Conference on Integer Programming and Combinatorial Optimization
Conferences -
Construction of a simulation model of goods delivery in international road transportation taking into account the functioning efficiency of logistics supply chain
PublicationThe object of this study is the process of goods delivery in international road transport using various types of logistics chains. The problem being solved is due to the need to develop recommendations for exporters of goods to reformat or design new supply chains during wartime. The expediency of organizing foreign trade operations by the cargo owners' own forces or with the involvement of enterprises providing logistics consulting...
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublicationIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Conferences -
International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
Conferences -
Analog CMOS processor for early vision processing with highly reduced power consumption
PublicationA new approach to an analog ultra-low power visionchip design is presented. The prototype chip performs low-levelconvolutional image processing algorithms in real time. Thecircuit is implemented in 0.35 μm CMOS technology, contains64 x 64 SIMD matrix with embedded analogue processors APE(Analogue Processing Element). The photo-sensitive-matrix is of2.2 μm x 2.2 μm size, giving the density of 877 processors permm2. The matrix dissipates...
-
Computational aspects of greedy partitioning of graphs
PublicationIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Zero-visibility cops and robber and the pathwidth of a graph
PublicationWe examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zero-visibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
Packing [1,Delta]-factors in graphs of small degree
PublicationRozważano problem znalezienia w grafie zadanej liczby k krawędziowo rozłącznych [1,Delta]-faktorów, gdzie Delta oznacza stopień grafu. Problem ten można rozwiązać w czasie liniowym dla k=2, jest on jednak NP-trudny dla każdego k>=3. Pokazano, że wariant minimalizacjny problemu dla k=2 jest NP-trudny dla grafów planarnych podkubicznych, jednak w ogólności istnieje algorytm (42 Delta - 30) / (35 Delta - 21) - aproksymacyjny.
-
Paired domination versus domination and packing number in graphs
PublicationGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
On zero-error codes produced by greedy algorithms
PublicationWe present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.
-
Secure Italian domination in graphs
PublicationAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
RETHINK-GSC Rethinking Global Supply Chains: measurement, impact and policy (HORIZON EUROPE)
ProjectsProject realized in Katedra Ekonomii according to Project 101061123 — RETHINK-GSC agreement from 2022-06-01
-
Improvements and new functionalities of UNRES server for coarse-grained modeling of protein structure, dynamics, and interactions
PublicationIn this paper we report the improvements and extensions of the UNRES server (https://unres-server.chem.ug.edu.pl) for physics-based simulations with the coarse-grained UNRES model of polypeptide chains. The improvements include the replacement of the old code with the recently optimized one and adding the recent scale-consistent variant of the UNRES force field, which performs better in the modeling of proteins with the β and the...
-
Parallel tabu search for graph coloring problem
PublicationTabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...
-
Bartosz Sawik
PeopleDr Bartosz Sawik is a Professor at the Department of Business Informatics and Engineering Management, AGH University of Science and Technology, Krakow, Poland and at the Institute of Smart Cities, GILT-OR Group, Department of Statistics, Computer Science and Mathematics, Public University of Navarre, Pamplona, Spain. He is a Visiting Researcher at the University of California, Berkeley, USA. He has a Ph.D. and a M.Sc. and Eng....
-
MULTIEQUATION MODELS AS DIAGNOSTIC TOOLS FOR MEASURING THE OPERATIONAL FLUIDITY OF THE CONTAINER HANDLING TERMINAL
PublicationThe article presents the continuation of the authors’ research on the problem of the operational fluidity of cargo handling sea terminals, based on the example of the DCT. The article presents a solution based on the multiequation models and applied to analyze the operational fluidity of terminals in the transshipment and feeder relation. To provide a solution to the problem of the functioning of sea-land supply chains at the terminal,...
-
Normal-form preemption sequences for an open problem in scheduling theory
PublicationStructural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemptions necessary, and a tight lower bound on shifts, i.e., the sizes of intervals bounded by the times created by preemptions, job starts, or completions. These two parameters have been investigated for a large class of preemptive scheduling problems,...
-
Interference between Land and Sea Logistics Systems. Multifunctional Building System Design Towards Autonomous Integrated Transport Infrastructure
PublicationThe research is focused on developing design theory towards efficient multifunctional facilities for logistics supply chains in the contemporary urban city structures. The development of modern systems based on autonomous transport creates new conditions for their management and generates an emerging need to define dedicated functional service structures. An important element of consideration also taken into account is the scenario...
-
CMOS implementation of an analogue median filter for image processing in real time
PublicationAn analogue median filter, realised in a 0.35 μm CMOS technology, is presented in this paper. The key advantages of the filter are: high speed of image processing (50 frames per second), low-power operation (below 1.25 mW under 3.3 V supply) and relatively high accuracy of signal processing. The presented filter is a part of an integrated circuit for image processing (a vision chip), containing: a photo-sensor matrix, a set of...
-
Digital Transformation and Its Influence on Sustainable Manufacturing and Business Practices
PublicationThe paper focuses on the relationship between businesses and digital transformation, and how digital transformation has changed manufacturing in several ways. Aspects like Cloud Computing, vertical and horizontal integration, data communication, and the internet have contributed to sustainable manufacturing by decentralizing supply chains. In addition, digital transformation inventions such as predictive analysis and big data analytics...
-
Benchmarking Performance of a Hybrid Intel Xeon/Xeon Phi System for Parallel Computation of Similarity Measures Between Large Vectors
PublicationThe paper deals with parallelization of computing similarity measures between large vectors. Such computations are important components within many applications and consequently are of high importance. Rather than focusing on optimization of the algorithm itself, assuming specific measures, the paper assumes a general scheme for finding similarity measures for all pairs of vectors and investigates optimizations for scalability...
-
Import Intensity of Production, Tasks and Wages: Microlevel Evidence for Poland.
PublicationObjective: This article relates to recent literature on labour market consequences of production fragmentation within Global Value Chains, analysed in the presence of workers’ heterogeneity and differences in the task content of jobs. The main aim is to assess if there is a relationship between wages of Polish workers and the degree of Polish production dependence on imported inputs. Research Design & Methods: Using microdata from...
-
Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets
PublicationThis work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry...
-
Optimizing the parameters of a small standalone hybrid power system
PublicationA hybrid power plant consists of renewable energy resources, an energy storage, a discharge load and an emergency power supply. Power plant parameters are tailored to meet the requirements of continuity of supply, cost minimization, return on investment period and system capacity utilization. The papaer presents the methodology for selecting power plant parameters with a larger number of decision criteria. The task is solved...
-
International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems
Conferences -
Supervised-learning-based development of multi-bit RCS-reduced coding metasurfaces
PublicationCoding metasurfaces have been introduced as efficient tools allowing meticulous control over the electromagnetic (EM) scattering. One of their relevant application areas is radar cross section (RCS) reduction, which principally relies on the diffusion of impinging EM waves. Despite its significance, careful control of the scattering properties poses a serious challenge at the level of practical realization. This article is concerned...
-
An application for a new type of pneumatic engine concept
PublicationHeavy trucks are often equipped with loading and unloading systems like dock levellers with swing lip or telescopic lip. Most of these devices require hydro-electrical energy supply systems (eg. the pump that presses the working substance to the actuators must be propelled by electric engine.) The space taken by pump with electric engine can be reduced on condition that a new type of pneumatic drive will be considered. It is possible...
-
Parallel Programming for Modern High Performance Computing Systems
PublicationIn view of the growing presence and popularity of multicore and manycore processors, accelerators, and coprocessors, as well as clusters using such computing devices, the development of efficient parallel applications has become a key challenge to be able to exploit the performance of such systems. This book covers the scope of parallel programming for modern high performance computing systems. It first discusses selected and...
-
Urban Freight Transport Demand Modelling and Data Availability Constraints
PublicationThe paper provides a review of urban freight transport demand modelling approaches confronted with constrains regarding adequate data provision from a perspective of the local authorities. Demand estimation models has been selected as a reference because they are the most representative in terms of inclusion of urban freight indicators which can be transformed into a decision-support tool for evaluation of freight measures. The...
-
Standard deviation as the optimization criterion in the OptD method and its influence on the generated DTM
PublicationReduction of the measurement dataset is one of the current issues related to constantly developing technologies that provide large datasets, eg. laser scanning. It could seems that presence and evolution of processors computer, increase of hard drive capacity etc. is the solution for development of such large datasets. And in fact it is, however, the “lighter” datasets are easier to work with. Additionally, reduced datasets can...
-
Can Communication Power of Separable Correlations Exceed That of Entanglement Resource?
PublicationThe scenario of remote state preparation with a shared correlated quantum state and one bit of forward communication [B. Dakić et al., Nat. Phys. 8, 666 (2012)] is considered. Optimization of the transmission efficiency is extended to include general encoding and decoding strategies. The importance of the use of linear fidelity is recognized. It is shown that separable states cannot exceed the efficiency of entangled states by...
-
Survey of Methodologies, Approaches, and Challenges in Parallel Programming Using High-Performance Computing Systems
PublicationThis paper provides a review of contemporary methodologies and APIs for parallel programming, with representative technologies selected in terms of target system type (shared memory, distributed, and hybrid), communication patterns (one-sided and two-sided), and programming abstraction level. We analyze representatives in terms of many aspects including programming model, languages, supported platforms, license, optimization goals,...