Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Jacek Błażewicz - MaRDI portal

Jacek Błażewicz

From MaRDI portal
(Redirected from Person:310330)
Person:224835

Available identifiers

zbMath Open blazewicz.jacekDBLP00/6083WikidataQ24577058 ScholiaQ24577058MaRDI QIDQ224835

List of research outcomes





PublicationDate of PublicationType
Online early work scheduling on parallel machines2024-08-13Paper
An improved approximation algorithm for a scheduling problem with transporter coordination2024-04-02Paper
Exact approaches to late work scheduling on unrelated machines2023-09-07Paper
Two-machine flow-shop scheduling to minimize total late work: revisited2022-12-23Paper
Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work2022-12-23Paper
In memoriam: Moshe Dror2022-11-04Paper
Two-machine flow shop scheduling with a common due date to maximize total early work2022-03-18Paper
Mirror scheduling problems with early work and late work criteria2022-01-14Paper
Semi-online scheduling on two identical machines with a common due date to maximize total early work2021-01-13Paper
Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date2020-02-25Paper
Detecting life signatures with RNA sequence similarity measures2019-02-06Paper
An integrated model for the transshipment yard scheduling problem2018-04-03Paper
Scheduling on parallel identical machines with late work criterion: offline and online cases2018-02-28Paper
G-MAPSEQ -- a new method for mapping reads to a reference genome2018-01-26Paper
Graph algorithms for DNA sequencing -- origins, current models and the future2017-11-23Paper
Tabu search for the RNA partial degradation problem2017-07-27Paper
Novel dual discounting functions for the Internet shopping optimization problem: new algorithms2016-09-08Paper
Unified encoding for hyper-heuristics with application to bioinformatics2016-06-30Paper
Building the library of RNA 3D nucleotide conformations using the clustering approach2015-10-16Paper
A study of scheduling problems with preemptions on multi-core computers with GPU accelerators2015-09-30Paper
ModeLang: a new approach for experts-friendly viral infections modeling2015-03-16Paper
Erratum to: ``Internet shopping with price-sensitive discounts2015-02-23Paper
Optimal pathway reconstruction on 3D NMR maps2015-02-06Paper
Internet shopping with price sensitive discounts2014-09-26Paper
The Orderly Colored Longest Path Problem – a survey of applications and new algorithms2014-04-16Paper
A hyper-heuristic approach to sequencing by hybridization of DNA sequences2013-09-16Paper
New algorithms for coupled tasks scheduling – a survey2013-04-29Paper
https://portal.mardi4nfdi.de/entity/Q29037742012-08-01Paper
A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem2012-07-28Paper
Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem2012-07-11Paper
A simulated annealing hyper-heuristic methodology for flexible decision support2012-06-13Paper
DNA Sequencing—Tabu and Scatter Search Combined2012-06-08Paper
On the complexity of the independent set problem in triangle graphs2011-08-08Paper
Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion2011-06-08Paper
The simplified partial digest problem: approximation and a graph-theoretic model2011-01-28Paper
https://portal.mardi4nfdi.de/entity/Q30708452011-01-28Paper
https://portal.mardi4nfdi.de/entity/Q30708832011-01-28Paper
https://portal.mardi4nfdi.de/entity/Q30708942011-01-28Paper
https://portal.mardi4nfdi.de/entity/Q30709182011-01-28Paper
Towards prediction of HCV therapy efficiency2010-12-30Paper
Internet shopping optimization problem2010-09-02Paper
Genetic and Tabu search algorithms for peptide assembly problem2010-05-26Paper
Some operations research methods for analyzing protein sequences and structures2010-05-10Paper
On the approximability of the simplified partial digest problem2010-04-28Paper
DNA Sequencing by Hybridization via Genetic Search2009-08-13Paper
Modeling the process of human body iron homeostasis using a variant of timed Petri nets2009-06-24Paper
Finding Hamiltonian circuits in quasi-adjoint graphs2008-11-19Paper
Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem2008-02-11Paper
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem2008-01-18Paper
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date2007-10-10Paper
Handbook on Scheduling2007-08-20Paper
An analysis of the Petri net based model of the human body iron homeostasis process2007-07-17Paper
Dealing with repetitions in sequencing by hybridization2007-06-12Paper
https://portal.mardi4nfdi.de/entity/Q34423532007-05-18Paper
Selected papers from the Dagstuhl Workshop2007-05-15Paper
A note on the two machine job shop with the weighted late work criterion2007-05-15Paper
Some operations research methods for analyzing protein sequences and structures2007-04-19Paper
KI 2005: Advances in Artificial Intelligence2006-11-13Paper
Multistage isothermic sequencing by hybridization2006-08-23Paper
Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries2006-05-16Paper
Computational complexity of isothermic DNA sequencing by hybridization2006-04-28Paper
Evolutionary approaches to DNA sequencing with errors2006-03-07Paper
The two-machine flow-shop problem with weighted late work criterion and common due date2005-04-21Paper
Selected combinatorial problems of computational biology2005-02-09Paper
Sequencing by hybridization with isothermic oligonucleotide libraries2005-01-31Paper
An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints2004-11-22Paper
Scheduling jobs in open shops with limited machine availability2004-08-30Paper
https://portal.mardi4nfdi.de/entity/Q47373602004-08-11Paper
Scheduling malleable tasks on parallel processors to minimize the makespan2004-08-10Paper
Open shop scheduling problems with late work criteria.2004-01-26Paper
Optimal centralized algorithms for store-and-forward deadlock avoidance2003-10-16Paper
Complexity of DNA sequencing by hybridization.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44184482003-08-10Paper
Scheduling multiprocessor tasks on parallel processors with limited availability.2003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44144812003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q47899122003-04-23Paper
The complexity of two group scheduling problems2003-02-23Paper
https://portal.mardi4nfdi.de/entity/Q47918922003-02-04Paper
Hybrid genetic algorithm for DNA sequencing with errors2002-12-15Paper
Review of properties of different precedence graphs for scheduling problems2002-11-17Paper
Scheduling multiprocessor tasks on two parallel processors2002-09-30Paper
The disjunctive graph machine representation of the job shop scheduling problem2002-08-19Paper
https://portal.mardi4nfdi.de/entity/Q27765522002-07-08Paper
Resource Constrained Chain Scheduling of UET Jobs on Two Machines2002-07-01Paper
Linear and quadratic algorithms for scheduling chains and opposite chains2002-06-16Paper
On the recognition of de Bruijn graphs and their induced subgraphs2002-05-15Paper
Two-machine flow shops with limited machine availability2002-01-23Paper
https://portal.mardi4nfdi.de/entity/Q27355852001-09-02Paper
https://portal.mardi4nfdi.de/entity/Q27123592001-05-06Paper
https://portal.mardi4nfdi.de/entity/Q27123602001-05-06Paper
Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability2000-11-22Paper
Tabu search for DNA sequencing with false negatives and false positives2000-09-14Paper
Scheduling preemptable tasks on parallel processors with limited availability2000-08-21Paper
On some properties of DNA graphs2000-06-29Paper
Scheduling a divisible task in a two-dimensional toroidal mesh2000-06-13Paper
A note on disjunctive graph representation2000-04-10Paper
Scheduling with resource management in manufacturing systems1999-11-08Paper
Divisible task scheduling -- concept and verification: Special issue on task scheduling problems for parallel and distributed systems1999-04-28Paper
Scheduling multiprocessor tasks with chain constraints1999-02-22Paper
The job shop scheduling problem: Conventional and new solution techniques1998-10-18Paper
https://portal.mardi4nfdi.de/entity/Q43803721998-03-15Paper
Preemptive multiprocessor task scheduling with release times and time windows1998-01-28Paper
Distributed processing of divisible jobs with communication startup costs1997-08-11Paper
Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness1997-05-22Paper
Scheduling complete intrees on two uniform processors with communication delays1997-02-27Paper
Deadline scheduling of multiprocessor tasks1997-01-13Paper
https://portal.mardi4nfdi.de/entity/Q56906371997-01-07Paper
A local search approach for two-dimensional irregular cutting1996-08-19Paper
Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors1996-05-02Paper
https://portal.mardi4nfdi.de/entity/Q48434461996-04-29Paper
https://portal.mardi4nfdi.de/entity/Q48434471996-03-27Paper
https://portal.mardi4nfdi.de/entity/Q48434391995-08-13Paper
https://portal.mardi4nfdi.de/entity/Q43267891995-03-23Paper
Vehicle scheduling in two-cycle flexible manufacturing systems1995-01-11Paper
Scheduling preemptive multiprocessor tasks on dedicated processors1994-11-01Paper
Graph theoretical issues in computer networks1994-04-12Paper
Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors1994-04-05Paper
Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system1994-03-24Paper
Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness1994-02-17Paper
https://portal.mardi4nfdi.de/entity/Q42794841994-02-17Paper
Addendum: Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource1993-08-31Paper
Using a tabu search approach for solving the two-dimensional irregular cutting problem1993-08-16Paper
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40236771993-01-23Paper
Dynamic programming algorithm for a FMS scheduling problem1993-01-16Paper
Optimization aspects of deadlock prevention in packet-switching networks1993-01-16Paper
Scheduling multiprocessor tasks on three dedicated processors1993-01-16Paper
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource1992-06-28Paper
Mathematical programming formulations for machine scheduling: A survey1991-01-01Paper
A preemptive open shop scheduling problem with one resource1991-01-01Paper
Scheduling independent two processor tasks on a uniform duo-processor system1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33546521990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34702451989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34946431989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34702461988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38181151988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38181181988-01-01Paper
Minimizing mean weighted execution time loss on identical and uniform processors1987-01-01Paper
Minimizing mean flow time with parallel processors and resource constraints1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37513591987-01-01Paper
Time-Stamp Approach to Store-and-Forward Deadlock Prevention1987-01-01Paper
Scheduling Multiprocessor Tasks to Minimize Schedule Length1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38044331986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38219251986-01-01Paper
Dynamic storage allocation with limited compaction - complexity and some practical implications1985-01-01Paper
Scheduling independent 2-processor tasks to minimize schedule length1984-01-01Paper
Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33355081984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33476071984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36802711984-01-01Paper
Scheduling subject to resource constraints: Classification and complexity1983-01-01Paper
A linear time algorithm for restricted bin packing and scheduling problems1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33383161983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36771681983-01-01Paper
Solving the resource constrained deadline scheduling problem via reduction to the network flow problem1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38834811980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39013031980-01-01Paper
Deadline scheduling of tasks with ready times and resource constraints1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41822331979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41915941979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39408401978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41742361978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41860681978-01-01Paper
Simple algorithms for multiprocessor scheduling to meet deadlines1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41316561977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41454101977-01-01Paper
Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40885591976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41365741976-01-01Paper

Research outcomes over time

This page was built for person: Jacek Błażewicz