OpenAlex
PricingAboutJobs
Log inGet started
Work

Single machine scheduling with the total weighted late work and rejection cost

HTML

Year: 2024
Type: article
Source: Naval Research Logistics (NRL)
DOI: 10.1002/nav.22222
Authors: Yao‐Wen Sang, Jun‐Qiang Wang, Małgorzata Sterna, Jacek Błażewicz
Institutions: Nanjing University of Aeronautics and Astronautics, Northwestern Polytechnical University, Poznań University of Technology, Institute of Bioorganic Chemistry, Polish Academy of Sciences
Language: English

Topic: Scheduling and Optimization Algorithms
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: single machine scheduling, rejection cost, job rejection, NP-hardness, pseudo-polynomial time algorithm, fully polynomial time approximation scheme, deadlines

Open Access status: closed

Funders: National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities
Awards: G3163868441, G3260670457, G552332298, G8973916133
OpenAlex ID: W4401595083
FWCI: 0.875
Cites: 48
Cited by: 7
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security