Scheduling orders for multiple product types to minimize total weighted completion time
type: Item
instance of: scholarly article
title: Scheduling orders for multiple product types to minimize total weighted completion time
zbMATH Open document ID: 1113.90060
author: Joseph Y.-T. Leung
author: Haibing Li
author: Michael L. Pinedo
published in: Discrete Applied Mathematics
publication date: 2007-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5159558
zbMATH Keywords: order scheduling
zbMATH Keywords: approximation algorithms
zbMATH Keywords: design and analysis of algorithms
describes a project that uses: GLPK
MaRDI profile type: Publication
full work available at URL: j.dam.2006.09.012
OpenAlex ID: W2092252886
cites work: Coordinated scheduling of customer orders for quick response
cites work: Geometric algorithms and combinatorial optimization.
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: Order scheduling in an environment with dedicated resources in parallel
cites work: Scheduling orders for multiple product types with due date related objectives
cites work: Open shops with jobs overlap -- revisited
cites work: Q3525911
cites work: Structure of a simple scheduling polyhedron
cites work: A note on the complexity of the concurrent open shop problem
cites work: Open shops with jobs overlap
DOI: 10.1016/J.DAM.2006.09.012
description: scientific article; zbMATH DE number 5159558