A PTAS for minimizing total completion time of batch scheduling under tree precedence constraints

2009 WASE International Conference on Information Engineering, ICIE 2009

Volumn 2, Issue , 2009, Pages 361-363

  Ma, Ran ^a   Han, Xuefeng ^a  

^a HENAN POLYTECHNIC UNIVERSITY   (China)

Author keywords

Approximation scheme; Precedence constraints; Scheduling

Indexed keywords

APPROXIMATION SCHEME; BATCH-SCHEDULING; POLYNOMIAL TIME APPROXIMATION SCHEMES; PRECEDENCE CONSTRAINTS; PROCESSING TIME; RELEASE DATE; TOTAL COMPLETION TIME;

POLYNOMIAL APPROXIMATION; SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 70449498638     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIE.2009.177     Document Type: Conference Paper

References (6)

1. Brucker P., Scheduling Algorithm, Springerverlag, Berlin, 2001.
2. P. Baptiste, P. Brucker, S.Knust, V.Timkovsky. "Ten notes on equal-processing-time scheduling," 4OR, vol. 2, 2004, pp. 111127.
3. Cheng T.C.E., C.T.Ng, Yuan J., Liu Z.H., "Single Machine Parallel Batch Scheduling Subject to Precedence Constraints," Naval Research Logistics, vol. 51, 2004, pp. 949958.
4. Cheng T. C. E., Yuan Jinjiang, Yang Aifeng, "Scheduling a Batch Processing Machine Subject to Precedence Constraints," Navel Research Logistics, vol. 51, 2005, pp. 949958.
5. j = p to Minimize Total Weighted Completion Time," Journal of Industrial and Management Optimization, vol. 1, 2005, pp. 353-358.
6. Deng Xiaotie, Zhang Yuzhong, "Minimizing mean completion time in a batch processing system," Algorithmica, vol. 38, 2004, pp. 513-528.