Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
Cart
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Home
Journals
Applied Computer Systems
Volume 24 (2019): Issue 2 (December 2019)
Open Access
Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling
Vadim Romanuke
Vadim Romanuke
| Feb 20, 2020
Applied Computer Systems
Volume 24 (2019): Issue 2 (December 2019)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Feb 20, 2020
Page range:
150 - 160
DOI:
https://doi.org/10.2478/acss-2019-0019
Keywords
Boolean linear programming model
,
heuristic
,
job scheduling
,
job preemptions
,
relative gap
,
remaining available period
,
remaining processing period
,
single machine scheduling
,
total weighted tardiness
© 2019 Vadim Romanuke, published by Sciendo
This work is licensed under the Creative Commons Attribution 4.0 Public License.
Vadim Romanuke
Polish Naval Academy
Gdynia, Poland