@article{MB18,
  title =	 "Parameterized complexity of machine scheduling: 15
                  open problems",
  journal =	 "Computers \& Operations Research",
  volume =	 "100",
  pages =	 "254--261",
  year =	 "2018",
  issn =	 "0305-0548",
  doi =		 "10.1016/j.cor.2018.07.020",
  author =	 "Matthias Mnich and René van Bevern",
  keywords =	 "Parallel machines, Shop scheduling, Makespan, Total
                  completion time, Total tardiness, Throughput, Number
                  of tardy jobs",
  abstract =	 "Machine scheduling problems are a long-time key
                  domain of algorithms and complexity research. A
                  novel approach to machine scheduling problems are
                  fixed-parameter algorithms. To stimulate this
                  thriving research direction, we propose 15 open
                  questions in this area whose resolution we expect to
                  lead to the discovery of new approaches and
                  techniques both in scheduling and parameterized
                  complexity theory.",
  date =	 {2018-08-16},
  url_Preprint = {http://arxiv.org/abs/1709.01670},
  url_Slides =
                  {https://www.researchgate.net/publication/342122033_Open_problems_on_the_parameterized_complexity_of_scheduling_problems}
}

{"_id":"tAQfXEuCfXRcWDrxe","bibbaseid":"mnich-vanbevern-parameterizedcomplexityofmachinescheduling15openproblems-2018","authorIDs":["2fwXJtKDCNhaSNr5s"],"author_short":["Mnich, M.","van Bevern, R."],"bibdata":{"bibtype":"article","type":"article","title":"Parameterized complexity of machine scheduling: 15 open problems","journal":"Computers & Operations Research","volume":"100","pages":"254–261","year":"2018","issn":"0305-0548","doi":"10.1016/j.cor.2018.07.020","author":[{"firstnames":["Matthias"],"propositions":[],"lastnames":["Mnich"],"suffixes":[]},{"firstnames":["René"],"propositions":["van"],"lastnames":["Bevern"],"suffixes":[]}],"keywords":"Parallel machines, Shop scheduling, Makespan, Total completion time, Total tardiness, Throughput, Number of tardy jobs","abstract":"Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions in this area whose resolution we expect to lead to the discovery of new approaches and techniques both in scheduling and parameterized complexity theory.","date":"2018-08-16","url_preprint":"http://arxiv.org/abs/1709.01670","url_slides":"https://www.researchgate.net/publication/342122033_Open_problems_on_the_parameterized_complexity_of_scheduling_problems","bibtex":"@article{MB18,\n title =\t \"Parameterized complexity of machine scheduling: 15\n open problems\",\n journal =\t \"Computers \\& Operations Research\",\n volume =\t \"100\",\n pages =\t \"254--261\",\n year =\t \"2018\",\n issn =\t \"0305-0548\",\n doi =\t\t \"10.1016/j.cor.2018.07.020\",\n author =\t \"Matthias Mnich and René van Bevern\",\n keywords =\t \"Parallel machines, Shop scheduling, Makespan, Total\n completion time, Total tardiness, Throughput, Number\n of tardy jobs\",\n abstract =\t \"Machine scheduling problems are a long-time key\n domain of algorithms and complexity research. A\n novel approach to machine scheduling problems are\n fixed-parameter algorithms. To stimulate this\n thriving research direction, we propose 15 open\n questions in this area whose resolution we expect to\n lead to the discovery of new approaches and\n techniques both in scheduling and parameterized\n complexity theory.\",\n date =\t {2018-08-16},\n url_Preprint = {http://arxiv.org/abs/1709.01670},\n url_Slides =\n {https://www.researchgate.net/publication/342122033_Open_problems_on_the_parameterized_complexity_of_scheduling_problems}\n}\n\n\n\n","author_short":["Mnich, M.","van Bevern, R."],"key":"MB18","id":"MB18","bibbaseid":"mnich-vanbevern-parameterizedcomplexityofmachinescheduling15openproblems-2018","role":"author","urls":{" preprint":"http://arxiv.org/abs/1709.01670"," slides":"https://www.researchgate.net/publication/342122033_Open_problems_on_the_parameterized_complexity_of_scheduling_problems"},"keyword":["Parallel machines","Shop scheduling","Makespan","Total completion time","Total tardiness","Throughput","Number of tardy jobs"],"metadata":{"authorlinks":{"van bevern, r":"https://rvb.su/"}},"downloads":2,"html":""},"bibtype":"article","biburl":"http://rvb.su/rvb.bib","creationDate":"2021-01-06T14:16:51.467Z","downloads":2,"keywords":["parallel machines","shop scheduling","makespan","total completion time","total tardiness","throughput","number of tardy jobs"],"search_terms":["parameterized","complexity","machine","scheduling","open","problems","mnich","van bevern"],"title":"Parameterized complexity of machine scheduling: 15 open problems","year":2018,"dataSources":["SMwzc9Bzq5Np5ikev","G5GefJqqu2DtnCZXz"]}