Maciej Lichtenstein

According to our database, Maciej Lichtenstein authored at least 6 papers between 2004 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2013

Comment on 'the strong NP-completeness of 3-PARTITION problem with B<i>k^m</i>' by Zhongyi Jiang, Fangfang Chen, Chunqing Wu.

Adam Janiak, Maciej Lichtenstein, Mikhail Y. Kovalyov

J. Oper. Res. Soc., 2013

Strong NP-hardness of scheduling problems with learning or aging effect.

Adam Janiak, Mikhail Y. Kovalyov, Maciej Lichtenstein

Ann. Oper. Res., 2013

Scheduling problems with a common due window assignment: A survey.

Adam Janiak, Tomasz Kwiatkowski, Maciej Lichtenstein

Int. J. Appl. Math. Comput. Sci., 2013

2010

New perspectives in VLSI design automation: deterministic packing by Sequence Pair.

Adam Janiak, Andrzej Kozik, Maciej Lichtenstein

Ann. Oper. Res., 2010

2008

Tabu Search on GPU.

Adam Janiak, Wladyslaw A. Janiak, Maciej Lichtenstein

J. Univers. Comput. Sci., 2008

2004

Hybrid flow-shop scheduling problems with multiprocessor task systems.

Ceyda Oguz, Yakov Zinder, Van Ha Do, Adam Janiak, Maciej Lichtenstein

Eur. J. Oper. Res., 2004