@article{BPS19,
  author =	 {René A. van Bevern and Artem V. Pyatkin and Sergey
                  V. Sevastyanov},
  journal =	 {Siberian Electronic Mathematical Reports},
  title =	 {An algorithm with parameterized complexity of
                  constructing the optimal schedule for the routing
                  open shop problem with unit execution times},
  date =	 {2019-01-27},
  year =	 2019,
  volume =	 16,
  pages =	 {42--84},
  doi =		 {10.33048/semi.2019.16.003},
  issn =	 {1813-3304},
  abstract =	 {For the Routing Open Shop problem with unit
                  execution times, the first algorithm with
                  parameterized complexity is designed for
                  constructing an optimal schedule. Its running time
                  is bounded by a function (Pol(|V |) + f(m, g))·|I|,
                  where Pol(|V|) is a polynomial of the number of
                  network nodes, f(m, g) is a function of the number
                  of machines and the number of job locations, and |I|
                  is the input length in its compact encoding.}
}

{"_id":"bNz6MzMTeucTABbwg","bibbaseid":"vanbevern-pyatkin-sevastyanov-analgorithmwithparameterizedcomplexityofconstructingtheoptimalschedulefortheroutingopenshopproblemwithunitexecutiontimes-2019","authorIDs":["2fwXJtKDCNhaSNr5s"],"author_short":["van Bevern, R. A.","Pyatkin, A. V.","Sevastyanov, S. V."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["René","A."],"propositions":["van"],"lastnames":["Bevern"],"suffixes":[]},{"firstnames":["Artem","V."],"propositions":[],"lastnames":["Pyatkin"],"suffixes":[]},{"firstnames":["Sergey","V."],"propositions":[],"lastnames":["Sevastyanov"],"suffixes":[]}],"journal":"Siberian Electronic Mathematical Reports","title":"An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times","date":"2019-01-27","year":"2019","volume":"16","pages":"42–84","doi":"10.33048/semi.2019.16.003","issn":"1813-3304","abstract":"For the Routing Open Shop problem with unit execution times, the first algorithm with parameterized complexity is designed for constructing an optimal schedule. Its running time is bounded by a function (Pol(|V |) + f(m, g))·|I|, where Pol(|V|) is a polynomial of the number of network nodes, f(m, g) is a function of the number of machines and the number of job locations, and |I| is the input length in its compact encoding.","bibtex":"@article{BPS19,\n author =\t {René A. van Bevern and Artem V. Pyatkin and Sergey\n V. Sevastyanov},\n journal =\t {Siberian Electronic Mathematical Reports},\n title =\t {An algorithm with parameterized complexity of\n constructing the optimal schedule for the routing\n open shop problem with unit execution times},\n date =\t {2019-01-27},\n year =\t 2019,\n volume =\t 16,\n pages =\t {42--84},\n doi =\t\t {10.33048/semi.2019.16.003},\n issn =\t {1813-3304},\n abstract =\t {For the Routing Open Shop problem with unit\n execution times, the first algorithm with\n parameterized complexity is designed for\n constructing an optimal schedule. Its running time\n is bounded by a function (Pol(|V |) + f(m, g))·|I|,\n where Pol(|V|) is a polynomial of the number of\n network nodes, f(m, g) is a function of the number\n of machines and the number of job locations, and |I|\n is the input length in its compact encoding.}\n}\n\n","author_short":["van Bevern, R. A.","Pyatkin, A. V.","Sevastyanov, S. V."],"key":"BPS19","id":"BPS19","bibbaseid":"vanbevern-pyatkin-sevastyanov-analgorithmwithparameterizedcomplexityofconstructingtheoptimalschedulefortheroutingopenshopproblemwithunitexecutiontimes-2019","role":"author","urls":{},"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.464Z","downloads":2,"keywords":[],"search_terms":["algorithm","parameterized","complexity","constructing","optimal","schedule","routing","open","shop","problem","unit","execution","times","van bevern","pyatkin","sevastyanov"],"title":"An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times","year":2019,"dataSources":["SMwzc9Bzq5Np5ikev","G5GefJqqu2DtnCZXz"]}