Wieslaw Kubiak

	2012
29		Edward G. Coffman Jr., Dariusz Dereniowski, Wieslaw Kubiak: An efficient algorithm for finding ideal schedules. Acta Inf. 49(1): 1-14 (2012)
28		Dariusz Dereniowski, Wieslaw Kubiak: Routing equal-size messages on a slotted ring. J. Scheduling 15(4): 473-486 (2012)
	2010
27		Albert Corominas, Wieslaw Kubiak, Rafael Pastor: Mathematical programming modeling of the Response Time Variability Problem. European Journal of Operational Research 200(2): 347-357 (2010)
26		Behzad Hezarkhani, Wieslaw Kubiak: A coordinating contract for transshipment in a two-company supply chain. European Journal of Operational Research 207(1): 232-237 (2010)
25		Dariusz Dereniowski, Wieslaw Kubiak: Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines. J. Scheduling 13(5): 479-492 (2010)
24		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)
	2009
23		Wieslaw Kubiak, Djamal Rebaine, Chris N. Potts: Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors. Discrete Optimization 6(1): 79-91 (2009)
22		Joanna Józefowska, Lukasz Józefowski, Wieslaw Kubiak: Apportionment methods and the Liu-Layland problem. European Journal of Operational Research 193(3): 857-864 (2009)
	2008
21		Dominique de Werra, Tamás Kis, Wieslaw Kubiak: Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. J. Scheduling 11(1): 75-83 (2008)
20		Wieslaw Kubiak, Mesut Yavuz: Just-in-Time Smoothing Through Batching. Manufacturing & Service Operations Management 10(3): 506-518 (2008)
	2007
19		Albert Corominas, Wieslaw Kubiak, Natalia Moreno Palli: Response time variability. J. Scheduling 10(2): 97-110 (2007)
	2005
18		Wieslaw Kubiak: Minimization of ordered, symmetric half-products. Discrete Applied Mathematics 146(3): 287-300 (2005)
17		Jinliang Cheng, Wieslaw Kubiak: A half-product based approximation scheme for agreeably weighted completion time variance. European Journal of Operational Research 162(1): 45-54 (2005)
16		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)
15		Wieslaw Kubiak: Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing. J. Scheduling 8(4): 295-302 (2005)
	2003
14		Nadia Brauner, Gerd Finke, Wieslaw Kubiak: Complexity of One-Cycle Robotic Flow-Shops. J. Scheduling 6(4): 355-372 (2003)
	2002
13		Sylvain Gravier, Daniel Kobler, Wieslaw Kubiak: Complexity of list coloring problems with a fixed total number of colors. Discrete Applied Mathematics 117(1-3): 65-79 (2002)
12		Wieslaw Kubiak, Jacek Blazewicz, Piotr Formanowicz, Joachim Breit, Günter Schmidt: Two-machine flow shops with limited machine availability. European Journal of Operational Research 136(3): 528-540 (2002)
11		Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyov: Fast fully polynomial approximation schemes for minimizing completion time variance. European Journal of Operational Research 137(2): 303-309 (2002)
	2000
10		Jacek Blazewicz, Maciej Drozdowski, Piotr Formanowicz, Wieslaw Kubiak, Günter Schmidt II: Scheduling preemptable tasks on parallel processors with limited availability. Parallel Computing 26(9): 1195-1211 (2000)
	1999
9		Moshe Dror, Gerd Finke, Sylvain Gravier, Wieslaw Kubiak: On the complexity of a restricted list-coloring problem. Discrete Mathematics 195(1-3): 103-109 (1999)
8		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)
	1998
7		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)
6		Mikhail Y. Kovalyov, Wieslaw Kubiak: A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. J. Heuristics 3(4): 287-297 (1998)
	1997
5		Bernd Jurisch, Wieslaw Kubiak, Joanna Józefowska: Algorithms for Minclique Scheduling Problems. Discrete Applied Mathematics 72(1-2): 115-139 (1997)
4		Moshe Dror, Wieslaw Kubiak, Paolo Dell'Olmo: Scheduling Chains to Minimize Mean Flow Time. Inf. Process. Lett. 61(6): 297-301 (1997)
	1995
3		Wieslaw Kubiak: New Results on the Completion Time Variance Minimization. Discrete Applied Mathematics 58(2): 157-168 (1995)
	1993
2		Jacek Blazewicz, Wieslaw Kubiak, Silvano Martello: Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints. Discrete Applied Mathematics 42(2): 123-138 (1993)
	1987
1		Jacek Blazewicz, Wieslaw Kubiak, H. Röck, Jayme Luiz Szwarcfiter: Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. Acta Inf. 24(5): 513-524 (1987)

Coauthor Index

1	Jacek Blazewicz	[1] [2] [10] [12]
2	Nadia Brauner	[14]
3	Joachim Breit	[12]
4	Jinliang Cheng	[11] [17]
5	Edward G. Coffman Jr.	[29]
6	Albert Corominas	[19] [27]
7	Paolo Dell'Olmo	[4]
8	Dariusz Dereniowski	[25] [28] [29]
9	Moshe Dror	[4] [8] [9]
10	Maciej Drozdowski	[10]
11	Gerd Finke	[9] [14]
12	Piotr Formanowicz	[10] [12]
13	Valery S. Gordon	[7]
14	Sylvain Gravier	[9] [13]
15	Behzad Hezarkhani	[26]
16	Adam Janiak	[16]
17	Joanna Józefowska	[5] [22]
18	Lukasz Józefowski	[22]
19	Bernd Jurisch	[5]
20	Tamás Kis	[21] [24]
21	Daniel Kobler	[13]
22	Mikhail Y. Kovalyov	[6] [11] [16]
23	Joseph Y.-T. Leung	[8]
24	Silvano Martello	[2]
25	Natalia Moreno Palli	[19]
26	Rafael Pastor	[27]
27	Chris N. Potts	[23]
28	Djamal Rebaine	[23]
29	H. Röck	[1]
30	Günter Schmidt	[12]
31	Günter Schmidt II	[10]
32	Jayme Luiz Szwarcfiter	[1]
33	Frank Werner	[16]
34	Dominique de Werra	[21] [24]
35	Mesut Yavuz	[20]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page