default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam Janiak
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j53]Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov
, Erhan Kozan, Erwin Pesch:
Corrigendum to 'Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs' [Information Sciences, 224 (2013) 109-117]. Inf. Sci. 357: 217 (2016)- [j52]Adam Janiak, Wladyslaw A. Janiak:
Corrections to "Single-Processor Scheduling Problem With Dynamic Models of Task Release Dates". IEEE Trans. Syst. Man Cybern. Syst. 46(7): 1017 (2016) - 2015
- [j51]Mateusz Gorczyca, Adam Janiak, Wladyslaw A. Janiak, Marcin Dymanski:
Makespan optimization in a single-machine scheduling problem with dynamic job ready times - Complexity and algorithms. Discret. Appl. Math. 182: 162-168 (2015) - [j50]Adam Janiak, Wladyslaw A. Janiak, Tomasz Krysiak, Tomasz Kwiatkowski:
A survey on scheduling problems with due windows. Eur. J. Oper. Res. 242(2): 347-357 (2015) - 2014
- [j49]Adam Janiak, Tomasz Krysiak, Radoslaw Trela:
A Problem of Scheduling Jobs with Non-Monotonic Stepwise Values. Informatica 25(1): 37-53 (2014) - 2013
- [j48]Adam Janiak, Tomasz Kwiatkowski, Maciej Lichtenstein:
Scheduling problems with a common due window assignment: A survey. Int. J. Appl. Math. Comput. Sci. 23(1): 231-241 (2013) - [j47]Adam Janiak, Mikhail Y. Kovalyov, Maciej Lichtenstein:
Strong NP-hardness of scheduling problems with learning or aging effect. Ann. Oper. Res. 206(1): 577-583 (2013) - [j46]Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov, Erhan Kozan, Erwin Pesch:
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. Inf. Sci. 224: 109-117 (2013) - [j45]Adam Janiak, Maciej Lichtenstein, Mikhail Y. Kovalyov:
Comment on 'the strong NP-completeness of 3-PARTITION problem with Bkm' by Zhongyi Jiang, Fangfang Chen, Chunqing Wu. J. Oper. Res. Soc. 64(5): 787 (2013) - [j44]Adam Janiak, Mikhail Y. Kovalyov:
Letter to the Editor. Optim. Lett. 7(5): 1045 (2013) - 2012
- [j43]Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov, Frank Werner:
Soft due window assignment and scheduling of unit-time jobs on parallel machines. 4OR 10(4): 347-360 (2012) - [j42]Adrien Bellanger, Adam Janiak, Mikhail Y. Kovalyov, Ammar Oulamara:
Scheduling an unbounded batching machine with job processing time compatibilities. Discret. Appl. Math. 160(1-2): 15-23 (2012) - [j41]Adam Janiak, Mikhail Y. Kovalyov:
Scheduling jobs with position-dependent processing times. J. Oper. Res. Soc. 63(7): 1018-1020 (2012) - 2011
- [j40]Adam Janiak, Radoslaw Rudek:
A note on the learning effect in multi-agent optimization. Expert Syst. Appl. 38(5): 5974-5980 (2011) - [j39]Adam Janiak, Wladyslaw A. Janiak:
Single-Processor Scheduling Problem With Dynamic Models of Task Release Dates. IEEE Trans. Syst. Man Cybern. Part A 41(2): 264-271 (2011) - [e3]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. Lecture Notes in Computer Science 6591, Springer 2011, ISBN 978-3-642-20038-0 [contents] - [e2]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. Lecture Notes in Computer Science 6592, Springer 2011, ISBN 978-3-642-20041-0 [contents] - 2010
- [j38]Adam Janiak, Andrzej Kozik, Maciej Lichtenstein:
New perspectives in VLSI design automation: deterministic packing by Sequence Pair. Ann. Oper. Res. 179(1): 35-56 (2010) - [j37]Ngoc Thanh Nguyen, Radoslaw P. Katarzyniak, Adam Janiak:
Special issue on applied intelligent information systems. Appl. Intell. 32(2): 147 (2010) - [j36]Mateusz Gorczyca, Adam Janiak:
Resource level minimization in the discrete-continuous scheduling. Eur. J. Oper. Res. 203(1): 32-41 (2010) - [j35]Adam Janiak, Radoslaw Rudek:
Scheduling jobs under an aging effect. J. Oper. Res. Soc. 61(6): 1041-1048 (2010)
2000 – 2009
- 2009
- [j34]Adam Janiak, Wladyslaw A. Janiak, Radoslaw Rudek, Agnieszka Wielgus:
Solution algorithms for the makespan minimization problem with the general learning model. Comput. Ind. Eng. 56(4): 1301-1308 (2009) - [j33]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. Eur. J. Oper. Res. 193(3): 836-848 (2009) - [j32]Adam Janiak, Radoslaw Rudek:
Experience-Based Approach to Scheduling Problems With the Learning Effect. IEEE Trans. Syst. Man Cybern. Part A 39(2): 344-357 (2009) - [c8]Adam Janiak, Radoslaw Rudek, Wladyslaw A. Janiak:
On Scheduling Problems with an Intelligent Use of the Learning Effect. ACIIDS 2009: 7-12 - [e1]Ngoc Thanh Nguyen, Radoslaw P. 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]. Studies in Computational Intelligence 244, Springer 2009, ISBN 978-3-642-03957-7 [contents] - 2008
- [j31]Adam Janiak, Radoslaw Rudek:
A new approach to the learning effect: Beyond the learning curve restrictions. Comput. Oper. Res. 35(11): 3727-3736 (2008) - [j30]Adam Janiak, Adam Kasperski:
The minimum spanning tree problem with fuzzy costs. Fuzzy Optim. Decis. Mak. 7(2): 105-118 (2008) - [j29]Adam Janiak, Mikhail Y. Kovalyov:
Scheduling jobs in a contaminated area: a model and heuristic algorithms. J. Oper. Res. Soc. 59(7): 977-987 (2008) - [j28]Adam Janiak, Radoslaw Rudek:
Complexity results for single-machine scheduling with positional learning effects. J. Oper. Res. Soc. 59(10): 1430 (2008) - [j27]Adam Janiak, Wladyslaw A. Janiak, Maciej Lichtenstein:
Tabu Search on GPU. J. Univers. Comput. Sci. 14(14): 2416-2426 (2008) - [c7]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 - 2007
- [j26]Adam Janiak, Radoslaw Rudek:
The learning effect: Getting to the core of the problem. Inf. Process. Lett. 103(5): 183-187 (2007) - [j25]Adam Janiak, Tomasz Krysiak:
Single processor scheduling with job values depending on their completion times. J. Sched. 10(2): 129-138 (2007) - [j24]Adam Janiak, Mikhail Y. Kovalyov, Marcin Marek:
Soft Due Window Assignment and Scheduling on Parallel Machines. IEEE Trans. Syst. Man Cybern. Part A 37(5): 614-620 (2007) - 2006
- [j23]Karl Inderfurth, Adam Janiak, Mikhail Y. Kovalyov, Frank Werner:
Batching work and rework processes with limited deterioration of reworkables. Comput. Oper. Res. 33: 1595-1605 (2006) - [j22]Adam Janiak, Mikhail Y. Kovalyov:
Scheduling in a contaminated area: A model and polynomial algorithms. Eur. J. Oper. Res. 173(1): 125-132 (2006) - [j21]Adam Janiak, Mikhail Y. Kovalyov:
Job Sequencing with Exponential Functions of Processing Times. Informatica 17(1): 13-24 (2006) - 2005
- [j20]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. Ann. Oper. Res. 133(1-4): 163-174 (2005) - [j19]Adam Janiak, Mikhail Y. Kovalyov, Marie-Claude Portmann:
Single machine group scheduling with resource dependent setup and processing times. Eur. J. Oper. Res. 162(1): 112-121 (2005) - [j18]Adam Janiak, Mikhail Y. Kovalyov, Wieslaw Kubiak, Frank Werner:
Positive half-products and scheduling with controllable processing times. Eur. J. Oper. Res. 165(2): 416-422 (2005) - [c6]Adam Janiak, Marcin Winczaszek:
Common Due Window Assignment in Parallel Processor Scheduling Problem with Nonlinear Penalty Functions. PPAM 2005: 132-139 - 2004
- [j17]Ceyda Oguz, Yakov Zinder, Van Ha Do, Adam Janiak, Maciej Lichtenstein:
Hybrid flow-shop scheduling problems with multiprocessor task systems. Eur. J. Oper. Res. 152(1): 115-131 (2004) - [j16]Aleksander Bachman, Adam Janiak:
Scheduling jobs with position-dependent processing times. J. Oper. Res. Soc. 55(3): 257-264 (2004) - [c5]Adam Janiak, Marcin Marek:
Parallel Processor Scheduling Problems with Optimal Due Interval Determination. ENC 2004: 383-387 - [c4]Adam Janiak, Marcin Winczaszek:
A Single Processor Scheduling Problem with a Common Due Window Assignment. OR 2004: 213-220 - [c3]Adam Janiak, Tomasz Krysiak:
Multiprocessor Scheduling Problem with Stepwise Model of Job Value Change. OR 2004: 352-359 - 2002
- [j15]Aleksander Bachman, Adam Janiak, Mikhail Y. Kovalyov:
Minimizing the total weighted completion time of deteriorating jobs. Inf. Process. Lett. 81(2): 81-84 (2002) - [j14]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) - [j13]Aleksander Bachman, T. C. Edwin Cheng, Adam Janiak, C. T. Daniel Ng:
Scheduling start time dependent jobs to minimize the total weighted completion time. J. Oper. Res. Soc. 53(6): 688-693 (2002) - [c2]Aleksander Bachman, Adam Janiak, Mikhail Y. Kovalyov:
Single Machine Scheduling Problems with Exponentially Start Time Dependent Job Processing Times. OR 2002: 211-216 - [c1]Adam Janiak, Marcin Marek:
Scheduling Problems with Optimal Due Interval Assignment Subject to Some Generalized Criteria. OR 2002: 217-222 - 2001
- [j12]T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov:
Single machine batch scheduling with resource dependent setup and processing times. Eur. J. Oper. Res. 135(1): 177-183 (2001) - [j11]Adam Janiak, Yakov M. Shafransky, Alexander Tuzikov:
Sequencing with Ordered Criteria, Precedence and Group Technology Constraints. Informatica 12(1): 61-88 (2001) - 2000
- [j10]T. C. Edwin Cheng, Adam Janiak:
A permutation flow-shop scheduling problem with convex models of operation processing times. Ann. Oper. Res. 96(1-4): 39-60 (2000) - [j9]Aleksander Bachman, Adam Janiak:
Minimizing maximum lateness under linear deterioration. Eur. J. Oper. Res. 126(3): 557-566 (2000)
1990 – 1999
- 1998
- [j8]Adam Janiak, Marie-Claude Portmann:
Genetic algorithm for the permutation flow-shopscheduling problem with linear models of operations. Ann. Oper. Res. 83: 95-114 (1998) - [j7]Adam Janiak:
Minimization of the makespan in a two-machine problem under given resource constraints. Eur. J. Oper. Res. 107(2): 325-337 (1998) - [j6]T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov:
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times. SIAM J. Optim. 8(2): 617-630 (1998) - 1995
- [j5]Adam Janiak, Mikhail Y. Kovalyov:
Single machine group scheduling with ordered criteria. Ann. Oper. Res. 57(1): 191-201 (1995) - 1994
- [j4]Tai Chiu Edwin Cheng, Adam Janiak:
Resource optimal control in some single-machine scheduling problems. IEEE Trans. Autom. Control. 39(6): 1243-1246 (1994)
1980 – 1989
- 1989
- [j3]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) - 1987
- [j2]Adam Janiak:
One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika 23(4): 289-293 (1987) - 1986
- [j1]Adam Janiak:
Time-optimal control in a single machine problem with resource constraints. Autom. 22(6): 745-747 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
