On the Complexity of Non-preemptive Shop Scheduling with Two Jobs - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Tamás Kis. On the Complexity of Non-preemptive Shop Scheduling with Two Jobs. Computing, 69(1):37-49, 2002. [doi]

@article{Kis02,
  title = {On the Complexity of Non-preemptive Shop Scheduling with Two Jobs},
  author = {Tamás Kis},
  year = {2002},
  url = {http://www.link.springer.de/link/service/journals/00607/bibs/2069001/20690037.htm},
  researchr = {https://researchr.org/publication/Kis02},
  cites = {0},
  citedby = {0},
  journal = {Computing},
  volume = {69},
  number = {1},
  pages = {37-49},
}

runs on WebDSL