default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWieslaw Kubiak
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j58]Wieslaw Kubiak
:
A note on scheduling coupled tasks for minimum total completion time. Ann. Oper. Res. 320(1): 541-544 (2023)- [j57]Wieslaw Kubiak:
On the complexity of open shop scheduling with time lags. J. Sched. 26(3): 331-334 (2023) - 2021
- [j56]Wieslaw Kubiak:
On a conjecture for the university timetabling problem. Discret. Appl. Math. 299: 26-49 (2021) - [i8]Wieslaw Kubiak:
On the complexity of open shop scheduling with time lags. CoRR abs/2107.08102 (2021) - 2020
- [j55]Dariusz Dereniowski, Wieslaw Kubiak:
Shared processor scheduling of multiprocessor jobs. Eur. J. Oper. Res. 282(2): 464-477 (2020) - [i7]Wieslaw Kubiak:
On a Conjecture for a Hypergraph Edge Coloring Problem. CoRR abs/2006.06393 (2020)
2010 – 2019
- 2018
- [j54]Dariusz Dereniowski, Wieslaw Kubiak:
Shared processor scheduling. J. Sched. 21(6): 583-593 (2018) - [i6]Dariusz Dereniowski, Wieslaw Kubiak:
Shared Processor Scheduling of Multiprocessor Jobs. CoRR abs/1807.08011 (2018) - 2017
- [j53]Dariusz Dereniowski, Wieslaw Kubiak:
Shared multi-processor scheduling. Eur. J. Oper. Res. 261(2): 503-514 (2017) - [i5]Dariusz Dereniowski, Wieslaw Kubiak:
Shared processor scheduling. CoRR abs/1704.06361 (2017) - 2016
- [j52]Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak:
Normal-form preemption sequences for an open problem in scheduling theory. J. Sched. 19(6): 701-728 (2016) - [i4]Dariusz Dereniowski, Wieslaw Kubiak:
Shared multi-processor scheduling. CoRR abs/1607.06021 (2016) - 2015
- [j51]Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols:
The complexity of minimum-length path decompositions. J. Comput. Syst. Sci. 81(8): 1715-1747 (2015) - [j50]Yann Hendel, Wieslaw Kubiak, Denis Trystram:
Scheduling semi-malleable jobs to minimize mean flow time. J. Sched. 18(4): 335-343 (2015) - [j49]Behzad Hezarkhani, Wieslaw Kubiak:
Decentralized subcontractor scheduling with divisible jobs. J. Sched. 18(5): 497-511 (2015) - [i3]Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak:
Structural Properties of an Open Problem in Preemptive Scheduling. CoRR abs/1502.04600 (2015) - 2014
- [j48]Behzad Hezarkhani, Wieslaw Kubiak, Bruce Hartman:
Asymptotic behavior of optimal quantities in symmetric transshipment coalitions. Oper. Res. Lett. 42(6-7): 438-443 (2014) - 2013
- [j47]Behzad Hezarkhani, Wieslaw Kubiak:
Transshipment games with identical newsvendors and cooperation costs. Math. Methods Oper. Res. 78(3): 315-339 (2013) - [j46]Dariusz Dereniowski, Wieslaw Kubiak, Bernard Ries, Yori Zwols:
Optimal edge-coloring with edge rate constraints. Networks 62(3): 165-182 (2013) - [j45]Alberto García-Villoria, Albert Corominas, Xavier Delorme, Alexandre Dolgui, Wieslaw Kubiak, Rafael Pastor:
A branch and bound algorithm for the response time variability problem. J. Sched. 16(2): 243-252 (2013) - [i2]Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols:
Minimum length path decompositions. CoRR abs/1302.2788 (2013) - [i1]Behzad Hezarkhani, Wieslaw Kubiak, Bruce Hartman:
On Transshipment Games with Identical Newsvendors. CoRR abs/1303.5934 (2013) - 2012
- [j44]Edward G. Coffman Jr., Dariusz Dereniowski, Wieslaw Kubiak:
An efficient algorithm for finding ideal schedules. Acta Informatica 49(1): 1-14 (2012) - [j43]Dariusz Dereniowski, Wieslaw Kubiak:
Routing equal-size messages on a slotted ring. J. Sched. 15(4): 473-486 (2012) - 2010
- [j42]Albert Corominas, Wieslaw Kubiak, Rafael Pastor:
Mathematical programming modeling of the Response Time Variability Problem. Eur. J. Oper. Res. 200(2): 347-357 (2010) - [j41]Behzad Hezarkhani, Wieslaw Kubiak:
A coordinating contract for transshipment in a two-company supply chain. Eur. J. Oper. Res. 207(1): 232-237 (2010) - [j40]Tamás Kis, Dominique de Werra, Wieslaw Kubiak:
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. Oper. Res. Lett. 38(2): 129-132 (2010) - [j39]Dariusz Dereniowski, Wieslaw Kubiak:
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines. J. Sched. 13(5): 479-492 (2010) - [c1]Behzad Hezarkhani, Wieslaw Kubiak:
Transshipment prices and pair-wise stability in coordinating the decentralized transshipment problem. BQGT 2010: 33:1-33:6
2000 – 2009
- 2009
- [j38]Wieslaw Kubiak, Djamal Rebaine, Chris N. Potts:
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors. Discret. Optim. 6(1): 79-91 (2009) - [j37]Joanna Józefowska, Lukasz Józefowski, Wieslaw Kubiak:
Apportionment methods and the Liu-Layland problem. Eur. J. Oper. Res. 193(3): 857-864 (2009) - 2008
- [j36]Wieslaw Kubiak, Mesut Yavuz:
Just-in-Time Smoothing Through Batching. Manuf. Serv. Oper. Manag. 10(3): 506-518 (2008) - [j35]Dominique de Werra, Tamás Kis, Wieslaw Kubiak:
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. J. Sched. 11(1): 75-83 (2008) - 2007
- [j34]Albert Corominas, Wieslaw Kubiak, Natalia Moreno Palli:
Response time variability. J. Sched. 10(2): 97-110 (2007) - 2005
- [j33]Wieslaw Kubiak:
Minimization of ordered, symmetric half-products. Discret. Appl. Math. 146(3): 287-300 (2005) - [j32]Jinliang Cheng, Wieslaw Kubiak:
A half-product based approximation scheme for agreeably weighted completion time variance. Eur. J. Oper. Res. 162(1): 45-54 (2005) - [j31]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) - [j30]Wieslaw Kubiak:
Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing. J. Sched. 8(4): 295-302 (2005) - 2004
- [r1]Wieslaw Kubiak:
Fair Sequences. Handbook of Scheduling 2004 - 2003
- [j29]Wieslaw Kubiak:
Cyclic Just-In-Time Sequences Are Optimal. J. Glob. Optim. 27(2-3): 333-347 (2003) - [j28]Nadia Brauner, Gerd Finke, Wieslaw Kubiak:
Complexity of One-Cycle Robotic Flow-Shops. J. Sched. 6(4): 355-372 (2003) - 2002
- [j27]Sylvain Gravier, Daniel Kobler, Wieslaw Kubiak:
Complexity of list coloring problems with a fixed total number of colors. Discret. Appl. Math. 117(1-3): 65-79 (2002) - [j26]Wieslaw Kubiak, Jacek Blazewicz, Piotr Formanowicz, Joachim Breit, Günter Schmidt:
Two-machine flow shops with limited machine availability. Eur. J. Oper. Res. 136(3): 528-540 (2002) - [j25]Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyov:
Fast fully polynomial approximation schemes for minimizing completion time variance. Eur. J. Oper. Res. 137(2): 303-309 (2002) - 2000
- [j24]Jacek Blazewicz, Maciej Drozdowski, Piotr Formanowicz, Wieslaw Kubiak, Günter Schmidt:
Scheduling preemptable tasks on parallel processors with limited availability. Parallel Comput. 26(9): 1195-1211 (2000)
1990 – 1999
- 1999
- [j23]Maciej Drozdowski, Wieslaw Kubiak:
Scheduling parallel tasks withsequential heads and tails. Ann. Oper. Res. 90: 221-246 (1999) - [j22]Moshe Dror, Gerd Finke, Sylvain Gravier, Wieslaw Kubiak:
On the complexity of a restricted list-coloring problem. Discret. Math. 195(1-3): 103-109 (1999) - [j21]Mikhail Y. Kovalyov, Wieslaw Kubiak:
A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem. Oper. Res. 47(5): 757-761 (1999) - [j20]Moshe Dror, Wieslaw Kubiak, Joseph Y.-T. Leung:
Tree Precedence in Scheduling: The Strong-Weak Distinction. Inf. Process. Lett. 71(3-4): 127-134 (1999) - [j19]Peter Brucker, Johann L. Hurink, Wieslaw Kubiak:
Scheduling identical jobs with chain precedence constraints on two uniform machines. Math. Methods Oper. Res. 49(2): 211-219 (1999) - 1998
- [j18]Mikhail Y. Kovalyov, Wieslaw Kubiak:
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. J. Heuristics 3(4): 287-297 (1998) - [j17]Wieslaw Kubiak, Jacek Blazewicz, Moshe Dror, N. Katoh, Hans Röck:
Resource Constrained Chain Scheduling of UET Jobs on Two Machines. Oper. Res. 46(5): 742-746 (1998) - [j16]Valery S. Gordon, Wieslaw Kubiak:
Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs. Inf. Process. Lett. 68(3): 153-159 (1998) - 1997
- [j15]Wieslaw Kubiak, George Steiner, Julian Scott Yeomans:
Optimal level schedules for mixed-model, multi-level just-in-time assembly systems. Ann. Oper. Res. 69: 241-259 (1997) - [j14]Bernd Jurisch, Wieslaw Kubiak, Joanna Józefowska:
Algorithms for Minclique Scheduling Problems. Discret. Appl. Math. 72(1-2): 115-139 (1997) - [j13]Bernd Jurisch, Wieslaw Kubiak:
Two-Machine Open Shops with Renewable Resources. Oper. Res. 45(4): 544-552 (1997) - [j12]Moshe Dror, Wieslaw Kubiak, Paolo Dell'Olmo:
Scheduling Chains to Minimize Mean Flow Time. Inf. Process. Lett. 61(6): 297-301 (1997) - 1996
- [j11]Wieslaw Kubiak, Sheldon X. C. Lou, Yingmeng Wang:
Mean Flow Time Minimization in Reentrant Job Shops with a Hub. Oper. Res. 44(5): 764-776 (1996) - 1995
- [j10]Wieslaw Kubiak, Suresh P. Sethi, Chelliah Sriskandarajah:
An efficient algorithm for a job shop problem. Ann. Oper. Res. 57(1): 203-216 (1995) - [j9]Wieslaw Kubiak:
New Results on the Completion Time Variance Minimization. Discret. Appl. Math. 58(2): 157-168 (1995) - 1994
- [j8]Joanna Józefowska, Bernd Jurisch, Wieslaw Kubiak:
Scheduling shops to minimize the weighted number of late jobs. Oper. Res. Lett. 16(5): 277-283 (1994) - 1993
- [j7]Jacek Blazewicz, Wieslaw Kubiak, Silvano Martello:
Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints. Discret. Appl. Math. 42(2): 123-138 (1993) - [j6]Wieslaw Kubiak:
Completion time variance minimization on a single machine is difficult. Oper. Res. Lett. 14(1): 49-59 (1993) - 1991
- [j5]Nicholas G. Hall, Wieslaw Kubiak, Suresh P. Sethi:
Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date. Oper. Res. 39(5): 847-856 (1991) - [j4]Dominique de Werra, Jacek Blazewicz, Wieslaw Kubiak:
A preemptive open shop scheduling problem with one resource. Oper. Res. Lett. 10(1): 9-15 (1991) - [j3]Nicholas G. Hall, Wieslaw Kubiak:
Proof of a conjecture of Schrage about the completion time variance problem. Oper. Res. Lett. 10(8): 467-472 (1991)
1980 – 1989
- 1989
- [j2]Wieslaw Kubiak:
Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints. ZOR Methods Model. Oper. Res. 33(6): 423-437 (1989) - 1987
- [j1]Jacek Blazewicz, Wieslaw Kubiak, Hans Röck, Jayme Luiz Szwarcfiter:
Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. Acta Informatica 24(5): 513-524 (1987)
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-04-24 23:14 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:
