Customer order scheduling to minimize total weighted completion time

In this paper we study the scheduling problem in which each customer order consists of several jobs of different types, which are to be processed on m facilities. Each facility is dedicated to the processing of only one type of jobs. All jobs of an order have to be delivered to the customer at the s...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Omega (Oxford) Ročník 35; číslo 5; s. 623 - 626
Hlavní autori: Wang, Guoqing, Cheng, T.C. Edwin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Exeter Elsevier Ltd 01.10.2007
Elsevier
Elsevier Science Publishers
Pergamon Press Inc
Edícia:Omega
Predmet:
Analysis
Applied sciences
Approximation
Approximation algorithm
Customer order scheduling
Customer order scheduling Linear programming relaxation Approximation algorithm
Exact sciences and technology
Heuristic
Inventory control, production control. Distribution
Linear programming
Linear programming relaxation
Methods
Operational research and scientific management
Operational research. Management science
Scheduling
Scheduling (Management)
Scheduling, sequencing
Studies
China
Linear programming relaxation
Approximation algorithm
Customer order scheduling
Production management
Linear relaxation
Worst case method
Heuristic method
NP hard problem
Linear programming
Scheduling
Order picking
Completion time
ISSN:0305-0483, 1873-5274
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper we study the scheduling problem in which each customer order consists of several jobs of different types, which are to be processed on m facilities. Each facility is dedicated to the processing of only one type of jobs. All jobs of an order have to be delivered to the customer at the same time. The objective is to schedule all the orders to minimize the total weighted order completion time. While the problem has been shown to be unary NP-hard, we develop a heuristics to tackle the problem and analyze its worst-case performance.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0305-0483
1873-5274
DOI:10.1016/j.omega.2005.09.007