Minimizing the number of tardy jobs on a single machine with batch setup times

Most read articles by the same author(s)

• Gerhard J. Woeginger, Computing maximum valued regions , Acta Cybernetica: Vol 10 No 4 (1992)
• Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger, A lower bound for on-line vector-packing algorithms , Acta Cybernetica: Vol 11 No 1-2 (1993)
• Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao, Partitioning graphs into two trees , Acta Cybernetica: Vol 11 No 3 (1994)
• Luitpold Babel, Gerhard J. Woeginger, Pseudo-hamiltonian graphs , Acta Cybernetica: Vol 14 No 4 (2000)
• Gerhard J. Woeginger, Jiří Sgall, The complexity of coloring graphs without long induced paths , Acta Cybernetica: Vol 15 No 1 (2001)
• Petra Schuur, Gerhard J. Woeginger, A PTAS for single machine scheduling with controllable processing times , Acta Cybernetica: Vol 15 No 3 (2002)
• Gerhard J. Woeginger, An algorithmic comparison of three scientific impact indices , Acta Cybernetica: Vol 19 No 3 (2010)
• Christian Eggermont, Cor Hurkens, Gerhard J. Woeginger, Realizing small tournaments through few permutations , Acta Cybernetica: Vol 21 No 2 (2013)