title: 3/2-approximation algorithm for a single machine scheduling problem
metadata.name: dc.contributor.author
metadata.value: Grigoreva, Natalia S.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2021-10-06T10:30:51Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2021-10-06T10:30:51Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2021-09
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Grigoreva N. S. 3/2-approximation algorithm for a single machine scheduling problem. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Cont- rol Processes, 2021, vol. 17, iss. 3, pp. 240-253.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu10.2021.302
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/33248
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: The problem of minimizing the maximum delivery times while scheduling tasks on a single
  processor is a classical combinatorial optimization problem. Each task ui must be processed
  without interruption for t(ui) time units on the machine, which can process at most one task
  at time. Each task uw; has a release time r(ui), when the task is ready for processing, and a
  delivery time g(ui). Its delivery begins immediately after processing has been completed. The
  objective is to minimize the time, by which all jobs are delivered. In the Graham notation this
  problem is denoted by 1|rj,qi|Cmax, it has many applications and it is NP-hard in a strong
  sense. The problem is useful in solving owshop and jobshop scheduling problems. The goal of
  this article is to propose a new 3/2-approximation algorithm, which runs in O(n log n) times
  for scheduling problem 1|rj.qi|Cmax. An example is provided which shows that the bound
  of 3/2 is accurate. To compare the effectiveness of proposed algorithms, random generated
  problems of up to 5000 tasks were tested.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: ru
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 17; Issue 3
metadata.lang: -
metadata.name: dc.subject
metadata.value: single-machine scheduling problem
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: realize and delivery times
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: approximation algorithm
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: guarantee approximation ratio
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: 3/2-approximation algorithm for a single machine scheduling problem
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 240-253.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/33248/1/240-253.pdf
resources.format: Adobe PDF
resources.size: 393,84 kB