| 2009 |
|---|
| 21 | EE | Adam Janiak,
Tomasz Krysiak,
Costas P. Pappis,
Theodore G. Voutsinas:
A scheduling problem with job values given as a power function of their completion times.
European Journal of Operational Research 193(3): 836-848 (2009) |
| 2008 |
|---|
| 20 | EE | Wladyslaw A. Janiak,
Adam Janiak,
Marie-Claude Portmann:
Single machine scheduling with job ready and delivery times subject to resource constraints.
IPDPS 2008: 1-7 |
| 19 | EE | Adam Janiak,
Radoslaw Rudek:
A new approach to the learning effect: Beyond the learning curve restrictions.
Computers & OR 35(11): 3727-3736 (2008) |
| 18 | | Adam Janiak,
Wladyslaw A. Janiak,
Maciej Lichtenstein:
Tabu Search on GPU.
J. UCS 14(14): 2416-2426 (2008) |
| 2007 |
|---|
| 17 | EE | Adam Janiak,
Mikhail Y. Kovalyov,
Marcin Marek:
Soft Due Window Assignment and Scheduling on Parallel Machines.
IEEE Transactions on Systems, Man, and Cybernetics, Part A 37(5): 614-620 (2007) |
| 16 | EE | Adam Janiak,
Radoslaw Rudek:
The learning effect: Getting to the core of the problem.
Inf. Process. Lett. 103(5): 183-187 (2007) |
| 15 | EE | Adam Janiak,
Tomasz Krysiak:
Single processor scheduling with job values depending on their completion times.
J. Scheduling 10(2): 129-138 (2007) |
| 2006 |
|---|
| 14 | EE | Karl Inderfurth,
Adam Janiak,
Mikhail Y. Kovalyov,
Frank Werner:
Batching work and rework processes with limited deterioration of reworkables.
Computers & OR 33: 1595-1605 (2006) |
| 13 | EE | Adam Janiak,
Mikhail Y. Kovalyov:
Scheduling in a contaminated area: A model and polynomial algorithms.
European Journal of Operational Research 173(1): 125-132 (2006) |
| 12 | EE | Adam Janiak,
Mikhail Y. Kovalyov:
Job Sequencing with Exponential Functions of Processing Times.
Informatica, Lith. Acad. Sci. 17(1): 13-24 (2006) |
| 2005 |
|---|
| 11 | EE | Adam Janiak,
Marcin Winczaszek:
Common Due Window Assignment in Parallel Processor Scheduling Problem with Nonlinear Penalty Functions.
PPAM 2005: 132-139 |
| 10 | EE | C. T. Ng,
T. C. Edwin Cheng,
Adam Janiak,
Mikhail Y. Kovalyov:
Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time.
Annals OR 133(1-4): 163-174 (2005) |
| 9 | EE | Adam Janiak,
Mikhail Y. Kovalyov,
Marie-Claude Portmann:
Single machine group scheduling with resource dependent setup and processing times.
European Journal of Operational Research 162(1): 112-121 (2005) |
| 8 | EE | Adam Janiak,
Mikhail Y. Kovalyov,
Wieslaw Kubiak,
Frank Werner:
Positive half-products and scheduling with controllable processing times.
European Journal of Operational Research 165(2): 416-422 (2005) |
| 2004 |
|---|
| 7 | EE | Adam Janiak,
Marcin Marek:
Parallel Processor Scheduling Problems with Optimal Due Interval Determination.
ENC 2004: 383-387 |
| 6 | EE | Adam Janiak,
Marcin Winczaszek:
A Single Processor Scheduling Problem with a Common Due Window Assignment.
OR 2004: 213-220 |
| 5 | EE | Adam Janiak,
Tomasz Krysiak:
Multiprocessor Scheduling Problem with Stepwise Model of Job Value Change.
OR 2004: 352-359 |
| 4 | EE | Ceyda Oguz,
Yakov Zinder,
Van Ha Do,
Adam Janiak,
Maciej Lichtenstein:
Hybrid flow-shop scheduling problems with multiprocessor task systems.
European Journal of Operational Research 152(1): 115-131 (2004) |
| 2002 |
|---|
| 3 | EE | Aleksander Bachman,
Adam Janiak,
Mikhail Y. Kovalyov:
Minimizing the total weighted completion time of deteriorating jobs.
Inf. Process. Lett. 81(2): 81-84 (2002) |
| 2 | EE | C. T. Ng,
T. C. Edwin Cheng,
Aleksander Bachman,
Adam Janiak:
Three scheduling problems with deteriorating jobs to minimize the total completion time.
Inf. Process. Lett. 81(6): 327-333 (2002) |
| 2001 |
|---|
| 1 | EE | Adam Janiak,
Yakov M. Shafransky,
Alexander Tuzikov:
Sequencing with Ordered Criteria, Precedence and Group Technology Constraints.
Informatica, Lith. Acad. Sci. 12(1): 61-88 (2001) |
