Malgorzata Sterna

Malgorzata Sterna
Poznan University of Technology · Institute of Computing Science

Professor

About

44
Publications
3,694
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
787
Citations

Publications

Publications (44)
Article
This paper considers scheduling in a two-machine flow shop to maximize the total early work subject to a common due date. The early work of a job is a parameter defined as the total amount of the job that is processed before the specified due date. We mainly focus on the unweighted model in this paper, and propose a dynamic programming approach run...
Article
The paper presents the survey of scheduling problems with the criteria based on early and late work. Early and late work corresponds to the size of a job executed before and after its expected due date, respectively. Since the first survey on late work related criteria from 2011, a lot of new interesting results have been obtained, which are collec...
Article
In this paper, we consider four semi-online scheduling problems with the goal of early work maximization, which shares the same essence with late work minimization when the optimal offline solutions are determined, but differs from it when the approximation or online solutions are constructed. First, we prove a tight bound 65 for scheduling jobs wi...
Article
Early work criterion is a new-proposed objective in the scheduling field, in which the early parts of jobs processed before their due dates are aimed to be maximized. In this paper, we consider such a criterion for scheduling on two identical machines. For the simplified model with a common due date of all jobs, we show that the classical LPT (Larg...
Article
Full-text available
We give a definition of a class of mirror scheduling problems, review existing representatives of this class and demonstrate that an identical parallel machine scheduling problem with precedence constraints and an upper bound on the makespan to minimize (maximize) the total weighted early work and the same problem with modified due dates, reversed...
Article
We study the scheduling problem on parallel identical machines in order to maximize the total early work, i.e. the parts of non-preemptive jobs executed before a common due date, and investigate mainly the model with a fixed number of machines, for which a dynamic programming approach and a fully polynomial time approximation scheme (FPTAS) are pro...
Book
This handbook provides a comprehensive introduction to the theory and applications of scheduling in advanced planning and computer systems. It addresses a broad audience including practitioners and researchers interested in scheduling, as well as graduate and advanced undergraduate students in the fields of computer science and computer engineering...
Article
This article revisits the scheduling problem in a two-machine flow-shop system with the total late work criterion, which penalizes parts of jobs executed after their due dates. Firstly, it is shown that a lower bound presented previously in the literature, in the context of a branch-and-bound algorithm proposed for the same problem, is invalid. The...
Article
Full-text available
We study the scheduling problem with a common due date on two parallel identical machines and the total early work criterion. The problem is known to be NP-hard. We prove a few dominance properties of optimal solutions of this problem. Their proposal was inspired by the results of some auxiliary computational experiments. Test were performed with t...
Article
Late work minimization is one of the newer branches in the scheduling theory, with the goal of minimizing the total size of late parts of all jobs in the system. In this paper, we study the scheduling problem in flow shop, which finds many practical applications. First, we prove that the problem with three machines and a common due date is NP-hard...
Article
Full-text available
The paper concerns complexity studies on the scheduling problem arising in a simple flexible manufacturing system. The system consists of a single machine, one depot (both with unlimited buffers), and one vehicle (automated guided vehicle). The vehicle operates according to the regular metro strategy. This means that it travels in cycles of the con...
Article
Full-text available
In the paper, we consider the problem of scheduling jobs on parallel identical machines with the late work criterion and a common due date, both offline and online cases. Since the late work criterion has not been studied in the online mode so far, the analysis of the online problem is preceded by the analysis of the offline problem, whose complexi...
Article
The paper concerns the optimization problem arising in charitable organizations during supply process. Such institutions are especially interested in minimizing the cost of purchase which consists of the prices at which particular products are bought as well as of the cost of their transportation. We present the formal mathematical model of the pro...
Article
The order completion and delivery problem is a common problem e.g. for small companies which resells products bought from producers. Such companies try to minimize both the cost of purchasing products and the cost of transportation. We present the formal mathematical model of the problem and the lower bound for the criterion value. We propose speci...
Article
The paper presents the first complete survey of scheduling problems with the late work criteria. Late work objective functions estimate the quality of a schedule based on durations of late parts of jobs, not taking into account the amount of delay for fully late jobs. The paper provides a formal definition of the late work parameter and compares th...
Article
The work concerns the permutation flow shop scheduling problem with release times and the late work criterion. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs, not taking into account the quantity of the delay for the fully late activities. Particular jobs consist of a sequence of ta...
Chapter
Full-text available
Revenue management is essentially the process of allocating resources to the right customer at the right time and the right price (cf. [9]). A slightly different approach to revenue maximization can be met in “classical” scheduling theory (cf. [3]), where the goal is to maximize the criterion value, i.e. the profit, for some given values of the pro...
Article
In this paper, metaheuristic approaches for the two-mach ine flow shop problem with a common due date and the weighted late work performance measure (F2|dj=d|Yw) are presented. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs, not taking into account the quantity of the delay f or the...
Article
The paper concerns a small flexible manufacturing system consisting of three CNC machines: a lathe machine, milling machine and measurement center and a single robot, located at the Poznań University of Technology. A short description of the production environment, which can be modeled as the extended job shop system with open shop sections within...
Article
,The paper,concerns,the two-machine,non-preemptive,flow shop,scheduling,problem,with,a total late work,criterion and,a common,due,date,(F 2|dj = d|Y ). The late work,performance,measure,estimates,the quality,of a solution,with,regard to the duration of late parts of activities performed in the system, not taking into account the quantity of this de...
Article
Full-text available
(EARLY PREPINT VERSION OF THE JOURNAL PAPER) The paper presents a dynamic programming approach for the two-machine nonpreemptive job-shop scheduling problem with the total weighted late work criterion and a common due date (J2|ni £ 2,di = d|Yw )(J2\,|\,n_i \le 2,d_i = d\,|\,Y_w ), which is known to be NP-hard. The late work performance measure esti...
Thesis
Publishing House of Poznan University of Technology, Poznan, 2006, ISBN 978-83-7143-269-9
Article
In this paper we analyze different solution procedures for the two-machine flow shop scheduling problem with a common due date and weighted late work criterion, i.e. for problem F2|dj=d|Yw , which is known to be binary NP-hard. In computational experiments we compare the practical efficiency of a dynamic programming approach, an enumerative method...
Conference Paper
Full-text available
In this paper, metaheuristic approaches for the weighted late work minimization in the two-machine flow shop problem with a common due date (F2 | d j =d | Y w ) are presented. The late work performance measure estimates the quality of a solution with regard to the duration of the late parts of jobs not taking into account the quantity of the delay...
Article
The paper is on the two-machine non-preemptive flow-shop scheduling problem with a total weighted late work criterion and a common due date (F2|dj=d|Yw). The late work performance measure estimates the quality of the obtained solution with regard to the duration of late parts of tasks not taking into account the quantity of this delay. We prove the...
Article
The paper presents a new graph representation, the graph matrix, which combines the adjacency matrix with the linked lists allowing for the fastest possible access to different types of information on a graph. This is increasingly important for a high search performance, for instance, for rapidly extracting information from the link structure in a...
Conference Paper
Full-text available
In the paper, we analyze different solution methods for the two-machine flow shop scheduling problem with a common due date with the weighted late work criterion, i.e. F2|di= d|Yw, which is known to be NP-hard. In computational experiments, we compared the practical efficiency of a dynamic programming approach, an enumerative method and heuristic...
Article
The paper concerns the application of a non-classical performance measure, a late work criterion (Y,Yw), to scheduling problems. It estimates the quality of the obtained solution with regard to the duration of the late parts of tasks not taking into account the quantity of this delay. The paper provides the formal definition of the late work parame...
Chapter
The disjunctive graph model is a commonly used representation of scheduling problems. We have proposed the modification of the disjunctive graph for the job shop scheduling problem with the schedule length criterion, which is the basis of a new consistent method of describing its instances. The graph is extended by an additional reverse arc connect...
Thesis
Scientific Publishers Polish Academy of Sciences, Poznań, ISBN 83-87671-39-8
Article
The paper analyzes an existing flexible manufacturing system containing two dedicated machines with buffer space and a transportation system in the form of a robot with a linear routing. A mathematical model of the system has been developed. In general, there are batches of identical parts to be produced in the system for which the technological ro...
Chapter
Scheduling theory is concerned with problems of the allocation of resources to perform a set of activities in order to achieve a certain goal. The purpose of the scheduling process could be attained by finding a feasible solution of the considered problem as well as by determining the best solution in the reference to a given optimality criterion....
Article
The criteria based on the late work parameter are examples of non-classical performance measures involving due dates. Classical criteria calculate the penalty for late tasks with respect to their completion time, whereas the late work criteria refer to the amount of the late work independently of the time of its completion.
Article
The disjunctive graph is one of the most popular models used for describing instances of the job shop scheduling problem, which has been very intensively explored. In this paper, a new time and memory efficient representation of the disjunctive graph is proposed. It has the form of a graph matrix and combines advantages of a few classical graph rep...
Article
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.
Chapter
The work is concerned with the deterministic case of the non-preemptive job shop scheduling problem. The presented approach is based on the problem representation in the form of a modified disjunctive graph extended by additional arcs. These modifications resulted from the analysis of time dependencies between feasible starting times of tasks. This...
Article
Full-text available
The research concerns the scheduling tool supporting the web service of-fering automatic text translation between Polish and three other languages. The web service accepts client orders submitted via WWW site and realizes them using special-ized translation software. The system consists of a few translation processes dedicated to particular transla...

Network

Cited By

Projects

Project (1)
Archived project
Project http://www.cs.put.poznan.pl/ishop/ Internet Shopping Optimization Project (IShOP) is an INTER POLLUX project, cofunded by Luxembourg National Research Funds (FNR) and the Polish National Research Centre for Research and Development (NCBiR). This project is a collaboration between the Laboratory of Algorithm Design and Programming Systems of the Institute of Computing Science, Poznan University of Technology, Poland, and the Interdisciplinary Center of Security, Reliability and Trust (SnT) of the University of Luxembourg, Luxembourg. ----- The Aim This project proposes innovative and realistic models for different typical online shopping operations, supported by strong mathematical and operational research fundamentals, and well balanced with lightweight computational algorithms. These models are designed in order to allow the optimization of such transactions. Finding accurate solutions to the defined problems implies both lowering customer expenses and favouring market competitiveness. One of the main aims of this project is to model and formulate new advanced and realistic flavours of the Internet Shopping Optimization Problem (ISOP), considering discounts and additional conditions like price sensitive shipping costs, incomplete offers from shops, or the minimization of the total realization time, price, and delivery time functions, among others. The models will be mathematically and theoretically well founded. Moreover, the challenge of defining and addressing a multi-criteria version of the problem will be addressed too. Other important contributions will be the mapping of ISOP to other new challenges. One of them is the design of a novel business model for cloud brokering that will benefit both cloud providers and consumers. Providers will be able to easily offer their large number of services, and to get a fast answer from the market to offers (e.g., when infrastructure is under-utilized). Additionally, customers will easily benefit from offers and find the most appropriate deals for his/her needs (according to service level agreements, pricing, performance, etc.). Modelling some of these aspects and coupling it with an optimization tool for the brokering of cloud services among various providers would be a key contribution to the field. A wide set of optimization algorithms will be designed and developed for the addressed problems. They include from fast lightweight specialized heuristics to highly accurate parallel and multi-objective population-based metaheuristics. They all will be embedded in a software framework for their practical applications, and validation.