Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
From MaRDI portal
Publication:5438523
DOI10.1002/NAV.20138zbMath1151.90420OpenAlexW2072584632MaRDI QIDQ5438523
Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo
Publication date: 23 January 2008
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20138
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Related Items (7)
Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines ⋮ An order scheduling problem with position-based learning effect ⋮ Metaheuristics for order scheduling problem with unequal ready times ⋮ Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time ⋮ Scheduling on parallel machines to minimise maximum lateness for the customer order problem
Cites Work
This page was built for publication: Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
