Skip to main content
Have a personal or library account? Click to login
Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling Cover

Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling

Applied Computer Systems
Volume 24 (2019): Issue 2 (December 2019)
By:   
Open Access
|Feb 2020
Authors

Authors

Vadim Romanuke

romanukevadimv@gmail.com

Polish Naval Academy, Gdynia, Poland
DOI: https://doi.org/10.2478/acss-2019-0019 | Journal eISSN: 2255-8691 | Journal ISSN: 2255-8683
Journal RSS Feed
Language: English
Page range: 150 - 160
Published on: Feb 20, 2020
Published by: Riga Technical University
In partnership with: Paradigm Publishing Services
Publication frequency: Volume open
Keywords:
Boolean linear programming model,
heuristic,
job scheduling,
job preemptions,
relative gap,
remaining available period,
remaining processing period,
single machine scheduling,
total weighted tardiness
Related subjects:
Computer sciences,
Artificial intelligence,
Information technology,
Project management,
Software development

© 2020 Vadim Romanuke, published by Riga Technical University
This work is licensed under the Creative Commons Attribution 4.0 License.

Volume 24 (2019): Issue 2 (December 2019)
Previous article
Next article