Janiak Adam

Adam Janiak

Information about the author Adam Janiak will soon be added to the site.
Found 24 papers in total
Strong NP‐hardness of scheduling problems with learning or aging effect
Strong NP‐hardness of scheduling problems with learning or aging effect
2013
Proofs of strong NP‐hardness of single machine and two‐machine flowshop...
Soft due window assignment and scheduling of unit‐time jobs on parallel machines
Soft due window assignment and scheduling of unit‐time jobs on parallel machines
2012
We study problems of scheduling n unit‐time jobs on m identical parallel...
Scheduling jobs with values dependent on their completion times
Scheduling jobs with values dependent on their completion times
2012
The paper concerns two scheduling problems with job values and losses of job values...
New perspectives in VLSI design automation: deterministic packing by Sequence Pair
New perspectives in VLSI design automation: deterministic packing by Sequence Pair
2010
In the paper we consider a problem of packing rectangular blocks on a plane, which is...
Resource management in machine scheduling problems: A survey
Resource management in machine scheduling problems: A survey
2007
The paper is a survey devoted to job scheduling problems with resource allocation. We...
Scheduling in a contaminated area: A model and polynomial algorithms
Scheduling in a contaminated area: A model and polynomial algorithms
2006
There are n jobs to be scheduled in a contaminated area. The jobs can be rescue,...
Single processor scheduling with job values depending on their completion times
Single processor scheduling with job values depending on their completion times
2007
The paper deals with a single processor scheduling problem in which the sum of values...
Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion
Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion
2007
In the paper, the flow-shop scheduling problem with parallel machines at each stage...
Batching work and rework processes with limited deterioration of reworkables
Batching work and rework processes with limited deterioration of reworkables
2006
We study a deterministic problem of planning the production of new and recovering...
Positive half-products and scheduling with controllable processing times
Positive half-products and scheduling with controllable processing times
2005
We study the single machine scheduling problem with controllable job processing times...
Single machine group scheduling with resource dependent setup and processing times
Single machine group scheduling with resource dependent setup and processing times
2005
A single machine scheduling problem is studied. There is a partition of the set of n...
Hybrid flow-shop scheduling problems with multiprocessor task systems
Hybrid flow-shop scheduling problems with multiprocessor task systems
2004
Hybrid flow-shop problems and problems with multiprocessor task systems have remained...
Scheduling jobs with position-dependent processing times
Scheduling jobs with position-dependent processing times
2004
The paper is devoted to some single machine scheduling problems, where job processing...
Scheduling jobs with piecewise linear decreasing processing times
Scheduling jobs with piecewise linear decreasing processing times
2003
We study the problems of scheduling a set of nonpreemptive jobs on a single or...
Single machine batch scheduling with resource dependent setup and processing times
Single machine batch scheduling with resource dependent setup and processing times
2001
Jobs are processed by a single machine in batches. A batch is a set of jobs processed...
Sequencing with ordered criteria, precedence and group technology constraints
Sequencing with ordered criteria, precedence and group technology constraints
2001
Multicriteria sequencing problems with criteria ordered according to their importance...
A permutation flow-shop scheduling problem wth convex models of operation processing times
A permutation flow-shop scheduling problem wth convex models of operation processing times
2000
The paper is an extension of the classical permutation flow-shop scheduling problem to...
Minimizing maximum lateness under linear deterioration
Minimizing maximum lateness under linear deterioration
2000
The paper deals with a single machine scheduling problem, where job processing time is...
Minimization of the makespan in a two-machine problem under given resource constraints
Minimization of the makespan in a two-machine problem under given resource constraints
1998
In this paper the classical two-machine flow-shop problem was generalized to the case...
Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
1998
The paper deals with a permutation flow-shop problem where processing times of jobs on...
Single machine scheduling subject to deadlines and resource dependent processing times
Single machine scheduling subject to deadlines and resource dependent processing times
1996
The problem of scheduling n jobs on a single machine is studied. Each job has a...
Single machine sequencing with linear models of release dates
Single machine sequencing with linear models of release dates
1998
The paper deals with a problem of scheduling a set of jobs on a single machine. Before...
Single machine group scheduling with ordered criteria
Single machine group scheduling with ordered criteria
1995
The single machine group scheduling problem is considered. Jobs are classified into...
Single machine scheduling problem with a common deadline and resource dependent release dates
Single machine scheduling problem with a common deadline and resource dependent release dates
1991
This paper deals with an extension of the classical single machine scheduling problem...
Papers per page: