Title of article
Scheduling orders for multiple product types to minimize total weighted completion time Original Research Article
Author/Authors
Joseph Y.-T. Leung، نويسنده , , Haibing Li، نويسنده , , Michael Pinedo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
26
From page
945
To page
970
Abstract
We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type
Keywords
Order scheduling , Design and analysis of algorithms , Approximation algorithms
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886476
Link To Document