OpenAlex
PricingAboutJobs
Log inGet started
Work

A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time

HTML

Year: 2005
Type: article
Source: Computers & Operations Research
DOI: 10.1016/j.cor.2005.03.028
Authors: Lixin Tang, Hua Xuan, Jiyin Liu
Institutions: Northeastern University, Loughborough University
Language: English

Topic: Scheduling and Optimization Algorithms
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: hybrid flow shop scheduling, weighted completion time, Lagrangian relaxation, identical parallel machines, precedence constraints, subgradient method, dynamic programming, integer programming formulation, Lagrangian decomposition, NP-hard scheduling

Open Access status: closed

Funders: National Natural Science Foundation of China, Ministry of Education of the People's Republic of China, Fok Ying Tung Education Foundation, Baosteel Group Corporation, National Science Fund for Distinguished Young Scholars
Awards: 基于VLNS的智能ILS优化方法及其在调度中的应用研究, G5595475270, 基于软计算的实时生产调度的理论研究
OpenAlex ID: W2007255274
FWCI: 13.14
Cites: 18
Cited by: 101
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security