default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMalgorzata Sterna
Person information
- affiliation: Poznań University of Technology, Poland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Man Xiao, Xiaoqiao Liu, Weidong Li, Xin Chen, Malgorzata Sterna
, Jacek Blazewicz:
Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work. Int. J. Appl. Math. Comput. Sci. 34(2) (2024)- 2023
- [j20]Xinbo Liu, Wen Wang, Xin Chen, Malgorzata Sterna, Jacek Blazewicz:
Exact approaches to late work scheduling on unrelated machines. Int. J. Appl. Math. Comput. Sci. 33(2) (2023) - 2022
- [j19]Xin Chen, Xuefeng Shen, Mikhail Y. Kovalyov, Malgorzata Sterna, Jacek Blazewicz:
Alternative algorithms for identical machines scheduling to maximize total early work with a common due date. Comput. Ind. Eng. 171: 108386 (2022) - [j18]Xin Chen, Qian Miao, Bertrand M. T. Lin, Malgorzata Sterna, Jacek Blazewicz:
Two-machine flow shop scheduling with a common due date to maximize total early work. Eur. J. Oper. Res. 300(2): 504-511 (2022) - [i1]Man Xiao, Xiaoqiao Liu, Weidong Li, Xin Chen, Malgorzata Sterna, Jacek Blazewicz:
Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work. CoRR abs/2209.08704 (2022) - 2021
- [j17]Xin Chen, Sergey Kovalev, Yuqing Liu, Malgorzata Sterna, Isabelle Chalamon, Jacek Blazewicz:
Semi-online scheduling on two identical machines with a common due date to maximize total early work. Discret. Appl. Math. 290: 71-78 (2021) - [j16]Xin Chen, Sergey Kovalev, Malgorzata Sterna, Jacek Blazewicz:
Mirror scheduling problems with early work and late work criteria. J. Sched. 24(5): 483-487 (2021) - 2020
- [j15]Xin Chen, Wen Wang, Pengyu Xie, Xingong Zhang, Malgorzata Sterna, Jacek Blazewicz:
Exact and heuristic algorithms for scheduling on two identical machines with early work maximization. Comput. Ind. Eng. 144: 106449 (2020) - [j14]Xin Chen, Yage Liang, Malgorzata Sterna, Wen Wang, Jacek Blazewicz:
Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date. Eur. J. Oper. Res. 284(1): 67-74 (2020)
2010 – 2019
- 2017
- [j13]Xin Chen, Vincent Chau, Pengyu Xie, Malgorzata Sterna, Jacek Blazewicz:
Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect. Comput. Ind. Eng. 111: 176-182 (2017) - [j12]Marie-Laure Espinouse, Grzegorz Pawlak, Malgorzata Sterna:
Complexity of Scheduling Problem in Single-Machine Flexible Manufacturing System with Cyclic Transportation and Unlimited Buffers. J. Optim. Theory Appl. 173(3): 1042-1054 (2017) - [j11]Malgorzata Sterna, Kateryna Czerniachowska:
Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work. J. Optim. Theory Appl. 174(3): 927-944 (2017) - 2016
- [j10]Xin Chen, Malgorzata Sterna, Xin Han, Jacek Blazewicz:
Scheduling on parallel identical machines with late work criterion: Offline and online cases. J. Sched. 19(6): 729-736 (2016) - 2015
- [j9]Mateusz Cichenski, Mateusz Jarus, Michal Miszkiewicz, Malgorzata Sterna, Jaroslaw Szymczak:
Supporting supply process in charitable organizations by genetic algorithm. Comput. Ind. Eng. 88: 39-48 (2015)
2000 – 2009
- 2009
- [j8]Erwin Pesch, Malgorzata Sterna:
Late work minimization in flow shops by a genetic algorithm. Comput. Ind. Eng. 57(4): 1202-1209 (2009) - 2008
- [j7]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. Comput. Oper. Res. 35(2): 574-599 (2008) - 2007
- [j6]Malgorzata Sterna:
Late work minimization in a small flexible manufacturing system. Comput. Ind. Eng. 52(2): 210-228 (2007) - [j5]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
A note on the two machine job shop with the weighted late work criterion. J. Sched. 10(2): 87-95 (2007) - 2005
- [j4]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion. Comput. Ind. Eng. 49(4): 611-624 (2005) - [j3]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
The two-machine flow-shop problem with weighted late work criterion and common due date. Eur. J. Oper. Res. 165(2): 408-415 (2005) - [c2]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date. KI 2005: 222-234 - 2004
- [j2]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Open shop scheduling problems with late work criteria. Discret. Appl. Math. 134(1-3): 1-24 (2004) - [c1]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy. AACC 2004: 68-75 - 2000
- [j1]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna:
The disjunctive graph machine representation of the job shop scheduling problem. Eur. J. Oper. Res. 127(2): 317-331 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
