Time-optimal control in a single machine problem with resource constraints. - Adam Janiak (Autom., 1986)

One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. - Adam Janiak (Kybernetika, 1987)

Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem. - Adam Janiak (Inf. Process. Lett., 1989)

Resource optimal control in some single-machine scheduling problems. - Tai Chiu Edwin Cheng; Adam Janiak (IEEE Trans. Autom. Control., 1994)

Single machine group scheduling with ordered criteria. - Adam Janiak; Mikhail Y. Kovalyov (Ann. Oper. Res., 1995)

Genetic algorithm for the permutation flow-shopscheduling problem with linear models of operations. - Adam Janiak; Marie-Claude Portmann (Ann. Oper. Res., 1998)

Minimization of the makespan in a two-machine problem under given resource constraints. - Adam Janiak (Eur. J. Oper. Res., 1998)

Bicriterion Single Machine Scheduling with Resource Dependent Processing Times. - T. C. Edwin Cheng; Adam Janiak; Mikhail Y. Kovalyov (SIAM J. Optim., 1998)

A permutation flow-shop scheduling problem with convex models of operation processing times. - T. C. Edwin Cheng; Adam Janiak (Ann. Oper. Res., 2000)

Minimizing maximum lateness under linear deterioration. - Aleksander Bachman; Adam Janiak (Eur. J. Oper. Res., 2000)

Single machine batch scheduling with resource dependent setup and processing times. - T. C. Edwin Cheng; Adam Janiak; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2001)

Sequencing with Ordered Criteria, Precedence and Group Technology Constraints. - Adam Janiak; Yakov M. Shafransky; Alexander Tuzikov (Informatica, 2001)

Single Machine Scheduling Problems with Exponentially Start Time Dependent Job Processing Times. - Aleksander Bachman; Adam Janiak; Mikhail Y. Kovalyov (OR, 2002)

Scheduling Problems with Optimal Due Interval Assignment Subject to Some Generalized Criteria. - Adam Janiak; Marcin Marek (OR, 2002)

Minimizing the total weighted completion time of deteriorating jobs. - Aleksander Bachman; Adam Janiak; Mikhail Y. Kovalyov (Inf. Process. Lett., 2002)

Three scheduling problems with deteriorating jobs to minimize the total completion time. - C. T. Ng 001; T. C. Edwin Cheng; Aleksander Bachman; Adam Janiak (Inf. Process. Lett., 2002)

Scheduling start time dependent jobs to minimize the total weighted completion time. - Aleksander Bachman; T. C. Edwin Cheng; Adam Janiak; C. T. Daniel Ng (J. Oper. Res. Soc., 2002)

Parallel Processor Scheduling Problems with Optimal Due Interval Determination. - Adam Janiak; Marcin Marek (ENC, 2004)

Multiprocessor Scheduling Problem with Stepwise Model of Job Value Change. - Adam Janiak; Tomasz Krysiak (OR, 2004)

A Single Processor Scheduling Problem with a Common Due Window Assignment. - Adam Janiak; Marcin Winczaszek (OR, 2004)

Hybrid flow-shop scheduling problems with multiprocessor task systems. - Ceyda Oguz; Yakov Zinder; Van Ha Do; Adam Janiak; Maciej Lichtenstein (Eur. J. Oper. Res., 2004)

Scheduling jobs with position-dependent processing times. - Aleksander Bachman; Adam Janiak (J. Oper. Res. Soc., 2004)

Common Due Window Assignment in Parallel Processor Scheduling Problem with Nonlinear Penalty Functions. - Adam Janiak; Marcin Winczaszek (PPAM, 2005)

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time. - C. T. Ng 001; T. C. Edwin Cheng; Adam Janiak; Mikhail Y. Kovalyov (Ann. Oper. Res., 2005)

Positive half-products and scheduling with controllable processing times. - Adam Janiak; Mikhail Y. Kovalyov; Wieslaw Kubiak; Frank Werner 001 (Eur. J. Oper. Res., 2005)

Single machine group scheduling with resource dependent setup and processing times. - Adam Janiak; Mikhail Y. Kovalyov; Marie-Claude Portmann (Eur. J. Oper. Res., 2005)

Batching work and rework processes with limited deterioration of reworkables. - Karl Inderfurth; Adam Janiak; Mikhail Y. Kovalyov; Frank Werner 001 (Comput. Oper. Res., 2006)

Scheduling in a contaminated area: A model and polynomial algorithms. - Adam Janiak; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2006)

Job Sequencing with Exponential Functions of Processing Times. - Adam Janiak; Mikhail Y. Kovalyov (Informatica, 2006)

The learning effect: Getting to the core of the problem. - Adam Janiak; Radoslaw Rudek (Inf. Process. Lett., 2007)

Single processor scheduling with job values depending on their completion times. - Adam Janiak; Tomasz Krysiak (J. Sched., 2007)

Soft Due Window Assignment and Scheduling on Parallel Machines. - Adam Janiak; Mikhail Y. Kovalyov; Marcin Marek (IEEE Trans. Syst. Man Cybern. Part A, 2007)

Single machine scheduling with job ready and delivery times subject to resource constraints. - Wladyslaw A. Janiak; Adam Janiak; Marie-Claude Portmann (IPDPS, 2008)

A new approach to the learning effect: Beyond the learning curve restrictions. - Adam Janiak; Radoslaw Rudek (Comput. Oper. Res., 2008)

The minimum spanning tree problem with fuzzy costs. - Adam Janiak; Adam Kasperski (Fuzzy Optim. Decis. Mak., 2008)

Scheduling jobs in a contaminated area: a model and heuristic algorithms. - Adam Janiak; Mikhail Y. Kovalyov (J. Oper. Res. Soc., 2008)

Complexity results for single-machine scheduling with positional learning effects. - Adam Janiak; Radoslaw Rudek (J. Oper. Res. Soc., 2008)

Tabu Search on GPU. - Adam Janiak; Wladyslaw A. Janiak; Maciej Lichtenstein (J. Univers. Comput. Sci., 2008)

On Scheduling Problems with an Intelligent Use of the Learning Effect. - Adam Janiak; Radoslaw Rudek; Wladyslaw A. Janiak (ACIIDS, 2009)

Solution algorithms for the makespan minimization problem with the general learning model. - Adam Janiak; Wladyslaw A. Janiak; Radoslaw Rudek; Agnieszka Wielgus (Comput. Ind. Eng., 2009)

A scheduling problem with job values given as a power function of their completion times. - Adam Janiak; Tomasz Krysiak; Costas P. Pappis; Theodore G. Voutsinas (Eur. J. Oper. Res., 2009)

Experience-Based Approach to Scheduling Problems With the Learning Effect. - Adam Janiak; Radoslaw Rudek (IEEE Trans. Syst. Man Cybern. Part A, 2009)

New perspectives in VLSI design automation: deterministic packing by Sequence Pair. - Adam Janiak; Andrzej Kozik; Maciej Lichtenstein (Ann. Oper. Res., 2010)

Special issue on applied intelligent information systems. - Ngoc Thanh Nguyen 001; Radoslaw P. Katarzyniak; Adam Janiak (Appl. Intell., 2010)

Resource level minimization in the discrete-continuous scheduling. - Mateusz Gorczyca; Adam Janiak (Eur. J. Oper. Res., 2010)

Scheduling jobs under an aging effect. - Adam Janiak; Radoslaw Rudek (J. Oper. Res. Soc., 2010)

A note on the learning effect in multi-agent optimization. - Adam Janiak; Radoslaw Rudek (Expert Syst. Appl., 2011)

Single-Processor Scheduling Problem With Dynamic Models of Task Release Dates. - Adam Janiak; Wladyslaw A. Janiak (IEEE Trans. Syst. Man Cybern. Part A, 2011)

Soft due window assignment and scheduling of unit-time jobs on parallel machines. - Adam Janiak; Wladyslaw A. Janiak; Mikhail Y. Kovalyov; Frank Werner 001 (4OR, 2012)

Scheduling an unbounded batching machine with job processing time compatibilities. - Adrien Bellanger; Adam Janiak; Mikhail Y. Kovalyov; Ammar Oulamara (Discret. Appl. Math., 2012)

Scheduling jobs with position-dependent processing times. - Adam Janiak; Mikhail Y. Kovalyov (J. Oper. Res. Soc., 2012)

Scheduling problems with a common due window assignment: A survey. - Adam Janiak; Tomasz Kwiatkowski; Maciej Lichtenstein (Int. J. Appl. Math. Comput. Sci., 2013)

Strong NP-hardness of scheduling problems with learning or aging effect. - Adam Janiak; Mikhail Y. Kovalyov; Maciej Lichtenstein (Ann. Oper. Res., 2013)

Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. - Adam Janiak; Wladyslaw A. Janiak; Mikhail Y. Kovalyov; Erhan Kozan; Erwin Pesch (Inf. Sci., 2013)

Comment on 'the strong NP-completeness of 3-PARTITION problem with Bkm' by Zhongyi Jiang, Fangfang Chen, Chunqing Wu. - Adam Janiak; Maciej Lichtenstein; Mikhail Y. Kovalyov (J. Oper. Res. Soc., 2013)

Letter to the Editor. - Adam Janiak; Mikhail Y. Kovalyov (Optim. Lett., 2013)

A Problem of Scheduling Jobs with Non-Monotonic Stepwise Values. - Adam Janiak; Tomasz Krysiak; Radoslaw Trela (Informatica, 2014)

Makespan optimization in a single-machine scheduling problem with dynamic job ready times - Complexity and algorithms. - Mateusz Gorczyca; Adam Janiak; Wladyslaw A. Janiak; Marcin Dymanski (Discret. Appl. Math., 2015)

A survey on scheduling problems with due windows. - Adam Janiak; Wladyslaw A. Janiak; Tomasz Krysiak; Tomasz Kwiatkowski (Eur. J. Oper. Res., 2015)

Corrigendum to 'Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs' [Information Sciences, 224 (2013) 109-117]. - Adam Janiak; Wladyslaw A. Janiak; Mikhail Y. Kovalyov; Erhan Kozan; Erwin Pesch (Inf. Sci., 2016)

Corrections to "Single-Processor Scheduling Problem With Dynamic Models of Task Release Dates". - Adam Janiak; Wladyslaw A. Janiak (IEEE Trans. Syst. Man Cybern. Syst., 2016)