Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
type: Item
instance of: scholarly article
title: Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
zbMATH Open document ID: 1152.90453
author: Joseph Y.-T. Leung
author: Haibing Li
author: Michael L. Pinedo
published in: Annals of Operations Research
publication date: 2008-09-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5320607
zbMATH Keywords: order scheduling
zbMATH Keywords: total weighted completion time
zbMATH Keywords: approximation algorithms
zbMATH Keywords: NP-hard
describes a project that uses: GLPK
MaRDI profile type: Publication
full work available at URL: s10479-007-0270-5
OpenAlex ID: W2013421526
cites work: The customer order lead-time problem on parallel machines
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
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: Q5702308
cites work: Scheduling orders for multiple product types with due date related objectives
cites work: Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
cites work: Scheduling orders for multiple product types to minimize total weighted completion time
cites work: Concurrent open shop scheduling to minimize the weighted number of tardy jobs
cites work: Structure of a simple scheduling polyhedron
cites work: Scheduling parallel machines for the customer order problem
DOI: 10.1007/S10479-007-0270-5
Recommended article: Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
Recommended article: Scheduling on parallel machines to minimise maximum lateness for the customer order problem
Recommended article: Scheduling parallel machines to minimize total weighted and unweighted tardiness
Recommended article: Scheduling parallel machines for the customer order problem
Recommended article: Order scheduling in an environment with dedicated resources in parallel
Recommended article: Fixed-order scheduling on parallel machines
Recommended article: Optimal scheduling on parallel machines for a new order class
Recommended article: Q5198314
Recommended article: Scheduling identical parallel machines to minimize total weighted completion time
Recommended article: Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
description: scientific article; zbMATH DE number 5320607