"A Hyper-Heuristic for the Preemptive Single Machine Scheduling Problem to ..."

Vadim V. Romanuke (2022)

> Home

Details and statistics

DOI: 10.2478/ACSS-2022-0001

access: open

type: Journal Article

metadata version: 2022-10-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/rigaacs/Romanuke22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rigaacs/Romanuke22
Vadim V. Romanuke:
A Hyper-Heuristic for the Preemptive Single Machine Scheduling Problem to Minimize the Total Weighted Tardiness. Appl. Comput. Syst. 27(1): 1-12 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.