Stanislaw Gawiejnowicz

Orcid: 0000-0002-1648-6987

According to our database1, Stanislaw Gawiejnowicz authored at least 32 papers between 1995 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Knapsack problems with position-dependent item weights or profits.
Ann. Oper. Res., July, 2023

A note on exact algorithms and heuristics for generation of V- and Λ-shaped sequences.
Comput. Ind. Eng., 2023

2021
Two- and three-machine open shop scheduling using LAPT-like rules.
Comput. Ind. Eng., 2021

2020
Models and Algorithms of Time-Dependent Scheduling, Second Edition
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-59361-5, 2020

New results for an open time-dependent scheduling problem.
J. Sched., 2020

A review of four decades of time-dependent scheduling: main results, new topics, and open problems.
J. Sched., 2020

Editorial: Dynamic Scheduling Problems.
J. Sched., 2020

2019
Scheduling preemptable position-dependent jobs on two parallel identical machines.
Comput. Ind. Eng., 2019

2018
An Enumerative Algorithm for a Two-Machine Preemptive Job Scheduling with a Learning Effect.
Proceedings of the 23rd International Conference on Methods & Models in Automation & Robotics, 2018

2014
Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria.
Comput. Oper. Res., 2014

Isomorphic scheduling problems.
Ann. Oper. Res., 2014

Multiagent Scheduling - Models and Algorithms.
Springer, ISBN: 978-3-642-41879-2, 2014

2013
Scheduling jobs with mixed processing times, arbitrary precedence constraints and maximum cost criterion.
Comput. Ind. Eng., 2013

2012
An exact algorithm and a heuristic for scheduling linearly deteriorating jobs with arbitrary precedence constraints and maximum cost criterion.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

2011
Single-machine scheduling of proportionally deteriorating jobs by two agents.
J. Oper. Res. Soc., 2011

2010
Complexity and approximability of scheduling resumable proportionally deteriorating jobs.
Eur. J. Oper. Res., 2010

Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect.
Comput. Ind. Eng., 2010

Scheduling time-dependent jobs under mixed deterioration.
Appl. Math. Comput., 2010

2009
Conjugate problems in time-dependent scheduling.
J. Sched., 2009

Equivalent time-dependent scheduling problems.
Eur. J. Oper. Res., 2009

2008
Time-Dependent Scheduling
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-69446-5, 2008

2007
Scheduling deteriorating jobs subject to job or machine availability constraints.
Eur. J. Oper. Res., 2007

2006
Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences.
Discret. Appl. Math., 2006

Pareto and scalar bicriterion optimization in scheduling deteriorating jobs.
Comput. Oper. Res., 2006

2005
A New Library for Evolutionary Algorithms.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

Parallel Machine Scheduling of Deteriorating Jobs by Modified Steepest Descent Search.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

2004
Book Review.
Math. Methods Oper. Res., 2004

2003
Minimizing Time-Dependent Total Completion Time on Parallel Identical Machines.
Proceedings of the Parallel Processing and Applied Mathematics, 2003

2001
NP-hard cases in scheduling deteriorating jobs on dedicated machines.
J. Oper. Res. Soc., 2001

A Greedy Approach for a Time-Dependent Scheduling Problem.
Proceedings of the Parallel Processing and Applied Mathematics, 2001

1996
A Note on Scheduling on a Single Processor with Speed Dependent on a Number of Executed Jobs.
Inf. Process. Lett., 1996

1995
Scheduling Jobs with Varying Processing Times.
Inf. Process. Lett., 1995


  Loading...