Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time

DOI10.1007/s10479-007-0270-5zbMath1152.90453OpenAlexW2013421526MaRDI QIDQ940879

Haibing Li, Joseph Y.-T. Leung, Michael L. Pinedo

Publication date: 3 September 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0270-5

zbMATH Keywords

NP-hardapproximation algorithmstotal weighted completion timeorder scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

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 ⋮ New approximate algorithms for the customer order scheduling problem with total completion time objective ⋮ An order scheduling problem with position-based learning effect ⋮ An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems ⋮ Metaheuristics for order scheduling problem with unequal ready times ⋮ Modeling efficiency in the presence of multiple partial input to output processes ⋮ Scheduling problems with position dependent job processing times: computational complexity results

Uses Software

• GLPK

Cites Work

• Unnamed Item
• Scheduling parallel machines for the customer order problem
• Order scheduling in an environment with dedicated resources in parallel
• Scheduling orders for multiple product types to minimize total weighted completion time
• Geometric algorithms and combinatorial optimization.
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• Structure of a simple scheduling polyhedron
• Scheduling orders for multiple product types with due date related objectives
• An Application of Bin-Packing to Multiprocessor Scheduling
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
• The customer order lead-time problem on parallel machines

This page was built for publication: Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time