Scheduling orders for multiple product types to minimize total weighted completion time

DOI10.1016/J.DAM.2006.09.012zbMath1113.90060OpenAlexW2092252886MaRDI QIDQ881573

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

Publication date: 30 May 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.09.012

zbMATH Keywords

approximation algorithmsorder schedulingdesign and analysis of algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (18)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints ⋮ New approximate algorithms for the customer order scheduling problem with total completion time objective ⋮ An order scheduling problem with position-based learning effect ⋮ A note on the complexity of the concurrent open shop problem ⋮ A learning-based two-stage optimization method for customer order scheduling ⋮ Minimizing the sum of weighted completion times in a concurrent open shop ⋮ An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems ⋮ Cost-sharing mechanisms for scheduling under general demand settings ⋮ On scheduling coflows ⋮ 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 ⋮ Unnamed Item ⋮ Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms ⋮ Select and permute: an improved online framework for scheduling to minimize weighted completion time ⋮ Scheduling on parallel machines to minimise maximum lateness for the customer order problem

Uses Software

• GLPK

Cites Work

• Unnamed Item
• Open shops with jobs overlap -- revisited
• Order scheduling in an environment with dedicated resources in parallel
• A note on the complexity of the concurrent open shop problem
• Geometric algorithms and combinatorial optimization.
• Open shops with jobs overlap
• Structure of a simple scheduling polyhedron
• Scheduling orders for multiple product types with due date related objectives
• Coordinated scheduling of customer orders for quick response
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

This page was built for publication: Scheduling orders for multiple product types to minimize total weighted completion time