DocumentCode
538244
Title
Customer order scheduling in parallel batching processors with splitting-merging procedure
Author
Huang, G.Q. ; Zhang, M.T.
Author_Institution
Dept. of Ind. & Manuf. Syst. Eng., Univ. of Hong Kong, Hong Kong, China
fYear
2010
fDate
6-9 Oct. 2010
Firstpage
1
Lastpage
5
Abstract
We considered the problem of customer orders scheduling in a set of parallel batching processors with the objective of minimizing total weighted tardiness. We provided three simple intuitive heuristics to batch the customer orders. The simulation results revealed that the split-merge heuristic can minimize the total weighted tardiness, especially in the case of high customer demand variation and tight due date.
Keywords
batch processing (industrial); customer services; minimisation; order processing; scheduling; customer demand variation; customer order scheduling; intuitive heuristics; parallel batching processor; split-merge heuristic; splitting-merging procedure; tight due date; total weighted tardiness; Companies; Job shop scheduling; Merging; Optimal scheduling; Processor scheduling; Program processors; customer order scheduling; demand variation; heuristics; parallel batching processor; sensitivity analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Supply Chain Management and Information Systems (SCMIS), 2010 8th International Conference on
Conference_Location
Hong Kong
Print_ISBN
978-962-367-696-0
Type
conf
Filename
5681725
Link To Document