Jan Weglarz

From MaRDI portal
Revision as of 08:21, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:213368

Available identifiers

zbMath Open weglarz.janDBLP75/5294WikidataQ6150240 ScholiaQ6150240MaRDI QIDQ213368

List of research outcomes





PublicationDate of PublicationType
Scheduling of network tasks to minimize the consumed energy2023-11-21Paper
Application of quantum approximate optimization algorithm to job shop scheduling problem2023-07-11Paper
Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems2018-07-19Paper
Scheduling aspects in keyword extraction problem2018-05-22Paper
Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource2016-10-21Paper
Evaluation of selected resource allocation and scheduling methods in heterogeneous many-core processors and graphics processing units2016-04-26Paper
Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic2015-02-06Paper
Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan2014-09-26Paper
Hierarchical scheduling strategies for parallel tasks and advance reservations in grids2014-08-18Paper
Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines2012-08-16Paper
Modelling and solving grid resource allocation problem with network resources for workflow applications2011-10-18Paper
Project scheduling with finite or infinite number of activity processing modes -- a survey2011-01-28Paper
https://portal.mardi4nfdi.de/entity/Q30708512011-01-28Paper
https://portal.mardi4nfdi.de/entity/Q30708842011-01-28Paper
Multicriteria, multi-user scheduling in grids with advance reservation2010-11-03Paper
A multicriteria approach to two-level hierarchy scheduling in grids2009-08-28Paper
DNA Sequencing by Hybridization via Genetic Search2009-08-13Paper
Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times2008-01-21Paper
Handbook on Scheduling2007-08-20Paper
https://portal.mardi4nfdi.de/entity/Q34264322007-03-09Paper
https://portal.mardi4nfdi.de/entity/Q34264412007-03-09Paper
Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models2005-03-08Paper
Scheduling malleable tasks on parallel processors to minimize the makespan2004-08-10Paper
An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44334612003-11-02Paper
Solving the discrete-continuous project scheduling problem via its discretization2003-08-18Paper
A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan2003-02-23Paper
Tabu list management methods for a discrete-continuous scheduling problem2002-06-16Paper
Simulated annealing for multi-mode resource-constrained project scheduling2001-10-31Paper
https://portal.mardi4nfdi.de/entity/Q27355852001-09-02Paper
Tabu search for DNA sequencing with false negatives and false positives2000-09-14Paper
Local search metaheuristics for discrete-continuous scheduling problems1999-09-13Paper
On a methodology for discrete-continuous scheduling1999-07-11Paper
Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs1999-06-28Paper
https://portal.mardi4nfdi.de/entity/Q42408681999-05-26Paper
Discrete-continuous scheduling problems -- mean completion time results1999-02-22Paper
https://portal.mardi4nfdi.de/entity/Q43803721998-03-15Paper
5th international workshop on project management and scheduling. Poznań, Poland, April 11--13, 19961998-01-01Paper
Minimization of mean flow time for some discrete-continuous scheduling problems1997-09-29Paper
Deadline scheduling of multiprocessor tasks1997-01-13Paper
https://portal.mardi4nfdi.de/entity/Q44334431996-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43267891995-03-23Paper
DSS for multiobjective project scheduling1995-01-11Paper
Approximation algorithms for some discrete-continuous scheduling problems1994-08-29Paper
https://portal.mardi4nfdi.de/entity/Q40236771993-01-23Paper
Dynamic programming algorithm for a FMS scheduling problem1993-01-16Paper
Time-optimal resource allocation under stepwise consumption constraints1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40129861992-09-27Paper
Mathematical programming formulations for machine scheduling: A survey1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34751181990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34846151989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38158441988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38181151988-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
Design of PRIME-like systems in a hard-real-time environment1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36822191985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37036371985-01-01Paper
Scheduling independent 2-processor tasks to minimize schedule length1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33476071984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32203451983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36629661983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47495891982-01-01Paper
Project Scheduling with Continuously-Divisible, Doubly Constrained Resources1981-01-01Paper
ON CERTAIN MODELS OF RESOURCE ALLOCATION PROBLEMS1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38834821980-01-01Paper
Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach1980-01-01Paper
Project Scheduling with Discrete and Continuous Resources1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41915941979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41491951978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41651141978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41860681978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41310291977-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/Q41520601977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40885591976-01-01Paper
Time-Optimal Control of Resource Allocation in a Complex of Operations Framework1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41426831976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32058461975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41430501975-01-01Paper

Research outcomes over time

This page was built for person: Jan Weglarz