Scheduling orders for multiple product types to minimize total weighted completion time

Discrete Applied Mathematics

Volumn 155, Issue 8, 2007, Pages 945-970

  Leung, Joseph Y T ^a   Li, Haibing ^a   Pinedo, Michael ^b  

^a University Heights   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Design and analysis of algorithms; Order scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; HEURISTIC ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PRODUCTION ENGINEERING;

DESIGN AND ANALYSIS OF ALGORITHMS; MULTIPLE PRODUCT TYPES; ORDER SCHEDULING; TOTAL WEIGHTED COMPLETION TIME;

SCHEDULING;

EID: 33947247951     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.09.012     Document Type: Article

References (19)

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates, The Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS'99), 1999, pp. 32-43.
2. Ahmadi R.H., and Bagchi U. Scheduling of Multi-job Customer Orders in Multi-machine Environments (1990), ORSA/TIMS, Philadelphia
3. R.H. Ahmadi, U. Bagchi, Coordinated scheduling of customer orders, Working paper, John E. Anderson Graduate School of Management, University of California, Los Angeles, 1993.
4. Ahmadi R.H., Bagchi U., and Roemer T. Coordinated scheduling of customer orders for quick response. Naval Res. Logist. 52 (2005) 493-512
5. Chekuri C., and Khanna S. Approximation algorithms for minimizing average weighted completion time. In: Leung J.Y.-T. (Ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004), CRC Press, Boca Raton, FL, USA
6. Z.-L. Chen, N.G. Hall, Supply chain scheduling: assembly systems, Working Paper, Department of Systems Engineering, University of Pennsylvania, 2001.
7. Grötschel M., Lovasz L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization (1993), Springer, Berlin
8. 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. Math. Oper. Res. 22 (1997) 513-544
9. Leung J.Y.-T., Li H., and Pinedo M.L. Order scheduling in an environment with dedicated resources in parallel. J. Sched. 8 (2005) 355-386
10. Leung J.Y.-T., Li H., and Pinedo M.L. Scheduling multiple product types with due date related objectives. Eur. J. Oper. Res. 168 (2006) 370-389
11. Leung J.Y.-T., Li H., Pinedo M.L., and Sriskandarajah S. Open shops with jobs overlap-revisited. Eur. J. Oper. Res. 163 (2005) 569-571
12. A. Makhorin, GNU linear programming kit: reference manual (version 4.8), 2005.
13. Pinedo M.L. Scheduling: Theory, Algorithms, and Systems. second ed. (2002), Prentice-Hall, Upper Saddle River, NJ
14. Queranne M. Structure of a simple scheduling polyhedron. Math. Program. 58 (1993) 263-285
15. Roemer T.A. A note on the complexity of the concurrent open shop problem. J. Sched. 9 (2006) 389-396
16. Smith W.E. Various optimizers for single stage production. Naval Res. Logist. Quart. 3 (1956) 59-66
17. Sung C.S., and Yoon S.H. Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines. Internat. J. Production Econ. 54 (1998) 247-255
18. Wagneur E., and Sriskandarajah C. Open shops with jobs overlap. Eur. J. Oper. Res. 71 (1993) 366-378
19. G. Wang, T.C.E. Cheng, Customer order scheduling to minimize total weighted completion time, Proceedings of the First Multidisciplinary Conference on Scheduling Theory and Applications, 2003, pp. 409-416.