 | 2012 |
| 38 |  | A. Bellanger,
Adam Janiak,
Mikhail Y. Kovalyov,
Ammar Oulamara:
Scheduling an unbounded batching machine with job processing time compatibilities.
Discrete Applied Mathematics 160(1-2): 15-23 (2012) |
| 2011 |
| 37 |  | Ngoc Thanh Nguyen,
Chonggun Kim,
Adam Janiak:
Intelligent Information and Database Systems - Third International Conference, ACIIDS 2011, Daegu, Korea, April 20-22, 2011, Proceedings, Part I
Springer 2011 |
| 36 |  | Ngoc Thanh Nguyen,
Chonggun Kim,
Adam Janiak:
Intelligent Information and Database Systems - Third International Conference, ACIIDS 2011, Daegu, Korea, April 20-22, 2011, Proceedings, Part II
Springer 2011 |
| 35 |  | Adam Janiak,
Radoslaw Rudek:
A note on the learning effect in multi-agent optimization.
Expert Syst. Appl. 38(5): 5974-5980 (2011) |
| 34 |  | Adam Janiak,
Wladyslaw A. Janiak:
Single-Processor Scheduling Problem With Dynamic Models of Task Release Dates.
IEEE Transactions on Systems, Man, and Cybernetics, Part A 41(2): 264-271 (2011) |
| 2010 |
| 33 |  | Adam Janiak,
Andrzej Kozik,
Maciej Lichtenstein:
New perspectives in VLSI design automation: deterministic packing by Sequence Pair.
Annals OR 179(1): 35-56 (2010) |
| 32 |  | Ngoc Thanh Nguyen,
Radoslaw Katarzyniak,
Adam Janiak:
Special issue on applied intelligent information systems.
Appl. Intell. 32(2): 147 (2010) |
| 31 |  | Mateusz Gorczyca,
Adam Janiak:
Resource level minimization in the discrete-continuous scheduling.
European Journal of Operational Research 203(1): 32-41 (2010) |
| 30 |  | Adam Janiak,
Radoslaw Rudek:
Scheduling jobs under an aging effect.
JORS 61(6): 1041-1048 (2010) |
| 2009 |
| 29 |  | Ngoc Thanh Nguyen,
Radoslaw Katarzyniak,
Adam Janiak:
New Challenges in Computational Collective Intelligence [selected papers from the 1st International Conference on Collective Intelligence - Semantic Web, Social Networks & Multiagent Systems, ICCCI 2009]
Springer 2009 |
| 28 |  | Adam Janiak,
Radoslaw Rudek,
Wladyslaw A. Janiak:
On Scheduling Problems with an Intelligent Use of the Learning Effect.
ACIIDS 2009: 7-12 |
| 27 |  | Adam Janiak,
Wladyslaw A. Janiak,
Radoslaw Rudek,
Agnieszka Wielgus:
Solution algorithms for the makespan minimization problem with the general learning model.
Computers & Industrial Engineering 56(4): 1301-1308 (2009) |
| 26 |  | 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) |
| 25 |  | Adam Janiak,
Radoslaw Rudek:
Experience-Based Approach to Scheduling Problems With the Learning Effect.
IEEE Transactions on Systems, Man, and Cybernetics, Part A 39(2): 344-357 (2009) |
| 2008 |
| 24 |  | 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 |
| 23 |  | Adam Janiak,
Radoslaw Rudek:
A new approach to the learning effect: Beyond the learning curve restrictions.
Computers & OR 35(11): 3727-3736 (2008) |
| 22 |  | Adam Janiak,
Adam Kasperski:
The minimum spanning tree problem with fuzzy costs.
FO & DM 7(2): 105-118 (2008) |
| 21 |  | Adam Janiak,
Wladyslaw A. Janiak,
Maciej Lichtenstein:
Tabu Search on GPU.
J. UCS 14(14): 2416-2426 (2008) |
| 2007 |
| 20 |  | 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) |
| 19 |  | Adam Janiak,
Radoslaw Rudek:
The learning effect: Getting to the core of the problem.
Inf. Process. Lett. 103(5): 183-187 (2007) |
| 18 |  | Adam Janiak,
Tomasz Krysiak:
Single processor scheduling with job values depending on their completion times.
J. Scheduling 10(2): 129-138 (2007) |
| 2006 |
| 17 |  | 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) |
| 16 |  | 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) |
| 15 |  | Adam Janiak,
Mikhail Y. Kovalyov:
Job Sequencing with Exponential Functions of Processing Times.
Informatica, Lith. Acad. Sci. 17(1): 13-24 (2006) |
| 2005 |
| 14 |  | Adam Janiak,
Marcin Winczaszek:
Common Due Window Assignment in Parallel Processor Scheduling Problem with Nonlinear Penalty Functions.
PPAM 2005: 132-139 |
| 13 |  | 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) |
| 12 |  | 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) |
| 11 |  | 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 |
| 10 |  | Adam Janiak,
Marcin Marek:
Parallel Processor Scheduling Problems with Optimal Due Interval Determination.
ENC 2004: 383-387 |
| 9 |  | Adam Janiak,
Marcin Winczaszek:
A Single Processor Scheduling Problem with a Common Due Window Assignment.
OR 2004: 213-220 |
| 8 |  | Adam Janiak,
Tomasz Krysiak:
Multiprocessor Scheduling Problem with Stepwise Model of Job Value Change.
OR 2004: 352-359 |
| 7 |  | 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 |
| 6 |  | Aleksander Bachman,
Adam Janiak,
Mikhail Y. Kovalyov:
Minimizing the total weighted completion time of deteriorating jobs.
Inf. Process. Lett. 81(2): 81-84 (2002) |
| 5 |  | 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 |
| 4 |  | T. C. Edwin Cheng,
Adam Janiak,
Mikhail Y. Kovalyov:
Single machine batch scheduling with resource dependent setup and processing times.
European Journal of Operational Research 135(1): 177-183 (2001) |
| 3 |  | 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) |
| 2000 |
| 2 |  | Aleksander Bachman,
Adam Janiak:
Minimizing maximum lateness under linear deterioration.
European Journal of Operational Research 126(3): 557-566 (2000) |
| 1989 |
| 1 |  | Adam Janiak:
Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem.
Inf. Process. Lett. 32(3): 101-112 (1989) |