Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering. Blekinge Inst Technol, Karlskrona, Sweden..
Natl Acad Sci Belarus, BLR.
Otto von Guericke Univ, DEU.
Servolux, Mogilev, BLR.
2019 (English)In: Automation and remote control, ISSN 0005-1179, E-ISSN 1608-3032, Vol. 80, no 2, p. 297-316Article in journal (Refereed) Published
Abstract [en]

A set of jobs has to be processed on parallel machines. For each job, there are given a release time and a due date and the job must be processed no later than its due date. If the job will be completed no later than the given due date, a benefit will be earned. Otherwise, this job will be rejected and the benefit will be discarded. The criterion under consideration is to maximize the weighted sum of the benefits and the number of jobs processed in time. Some properties of the objective function are found which allow to construct a optimal schedule. We develop a simulated annealing algorithm, a tabu search algorithm, and a genetic algorithm for solving this problem. The developed algorithms were tested on moderate and large instances with up to 500 jobs and 50 machines. Some recommendations are given showing how to use the obtained results and developed algorithms in production planning.

Place, publisher, year, edition, pages
MAIK NAUKA/INTERPERIODICA/SPRINGER , 2019. Vol. 80, no 2, p. 297-316
Keywords [en]
scheduling, uniform machines, revenue maximization, genetic algorithm, simulated annealing, tabu search
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:bth-17905DOI: 10.1134/S0005117919020085ISI: 000465860600008OAI: oai:DiVA.org:bth-17905DiVA, id: diva2:1316791
Available from: 2019-05-21 Created: 2019-05-21 Last updated: 2019-05-21Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Gholami, Omid

Search in DiVA

By author/editor
Gholami, Omid
By organisation
Department of Computer Science and Engineering
In the same journal
Automation and remote control
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 45 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf