Customer order scheduling to minimize total weighted completion time

Omega

Volumn 35, Issue 5, 2007, Pages 623-626

  Wang, Guoqing ^a   Cheng, T C Edwin ^b  

^a JINAN UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Approximation algorithm; Customer order scheduling; Linear programming relaxation

Indexed keywords

JOB SHOP SCHEDULING; LINEAR PROGRAMMING; SALES; SCHEDULING ALGORITHMS;

COMPLETION TIME; CUSTOMER ORDER SCHEDULING; CUSTOMER ORDERS; LINEAR PROGRAMMING RELAXATION; NP-HARD; SCHEDULING PROBLEM; TOTAL WEIGHTED COMPLETION TIME; WORST-CASE PERFORMANCE;

APPROXIMATION ALGORITHMS;

EID: 33751506151     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2005.09.007     Document Type: Article

References (11)

1. Wagneur E., and Sriskandarajah C. Open shops with jobs overlap. European Journal of Operational Research 71 (1993) 366-378
2. Leung J.Y.-T., Li H., and Pinedo M. Order scheduling models: an overview. In: Kendall G., Burke E., Petrovic S., and Gendreau M. (Eds). Multidisciplinary scheduling (2005) 37-56
3. Leung J, Li Y-TH, Pinedo M. Order scheduling in an environment with dedicated resources in parallel. Journal of Scheduling 2002, to appear.
4. Sung C.S., and Yoon S.H. Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines. International Journal of Production Economics 54 (1998) 247-255
5. Wang G, Cheng TCE. Customer order scheduling to minimize total weighted completion time. In: Proceedings of the First Multidisciplinary Conference on Scheduling Theory and Applications, p. 409-16.
6. Leung J.Y.-T., Li H., Pinedo M., and Sriskandarajah C. Open shops with jobs overlap-revisited. European Journal of Operational Research 163 (2005) 569C57
7. Hall L.A., Schulz A.S., Shmoys D.B., and Wein J. Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research 22 (1997) 513-544
8. Phillips C., Stein C., and Wein J. Minimizing average completion time in the presence of release dates. Mathematical Programming 82 (1998) 199-233
9. Schulz AS, Skutella M. Scheduling-LPs bear probabilities: randomized approximations for min-sum criteria. In: Burkard R, Woeginger G, editors. Algorithms-ESA '97, Lecture notes in computer science, 1284, 1997, p. 416-29.
10. Skutella MS. Convex quadratic programming relaxations for network scheduling problems. In: Nesetril J, editors. Algorithms-ESA '99, Lecture notes in computer science, 1643, 1999, p. 127-38.
11. Afrati F, Bampis E, Chekuri C, Karger D, Kenyon C, Khanna S, Milis I, Queyranne M, Skutella M, Stain C, Sviridenko M. Approximation schemes for minimizing average weighted completion time with release dates. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, to appear.