Coordinating production and distribution of jobs with bundling operations

IIE Transactions (Institute of Industrial Engineers)

Volumn 39, Issue 2, 2007, Pages 203-215

  Li, Chung Lun ^a   Vairaktarakis, George ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

Bundling operations; Coordination; Distribution; Polynomial time approximation schemes; Scheduling

Indexed keywords

APPROXIMATION THEORY; COSTS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; SCHEDULING;

BUNDLING OPERATIONS; COORDINATING PRODUCTION; INTEGRATED SCHEDULING; POLYNOMIAL-TIME APPROXIMATION SCHEMES;

PRODUCTION ENGINEERING;

EID: 33845300872     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170600735561     Document Type: Article

References (29)

1. Ahmadi, R. and Bagchi, U. and Roemer, T. (2005) Coordinated scheduling of customer orders for quick response Naval Research Logistics, 52, pp. 493-512. http://www.csa.com/htbin/linkabst.cgi?issn=0028-1441&vol= 52&iss=&firstpage=493 [CSA]
2. Blocher, J. and Chhajed, D. (1996) The customer order lead time problem on parallel machines Naval Research Logistics, 43, pp. 629-654. http://dx.doi.org/ 10.1002%2F%28SICI%291520-6750%28199608%2943%3A5%3C629%3A%3AAID -NAV3%3E3.0.CO%3B2-7
3. Blocher, J. and Chhajed, D. and Leung, M. (1998) Customer order scheduling in a general job shop environment Decision Sciences, 29, pp. 951-981. http://www.csa.com/htbin/linkabst.cgi?issn=1540-4595&vol= 29&iss=&firstpage=951 [CSA]
4. Cai, X. and Zhou, X. (2004) Deterministic and stochastic scheduling with teamwork tasks Naval Research Logistics, 51, pp. 818-840. http://dx.doi. org/10.1002%2Fnav.20021 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0028-1441&vol=51&iss=&firstpage=818 [CSA]
5. Chang, Y.-C. and Lee, X. (2004) Machine scheduling with job delivery coordination European Journal of Operational Research, 158, pp. 470-487. http://dx.doi.org/10.1016%2FS0377-2217%2803%2900364-3 [CROSSREF] http://www.csa.com/htbin/linkabst.cgi?issn=0377-2217&vol=158&iss= &firstpage=470 [CSA]
6. Chen, Z.-L.(2004) Integrated production and distribution operations: taxonomy, models, and review. In Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era. (pp. 711-745). Boston MA: Kluwer.
7. Chen, Z.-L. and Pundoor, G. (2006) Order assignment and scheduling in a supply chain Operations Research, 54, pp. 555-572. http://dx.doi.org/ 10.1287%2Fopre.1060.0280 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=54&iss=&firstpage=555 [CSA]
8. Chen, Z.-L. and Vairaktarakis, G. (2005) Integrated scheduling of production and distribution operations Management Science, 51, pp. 614-628. http://dx.doi.org/10.1287%2Fmnsc.1040.0325 [CROSSREF] http://www.csa.com/htbin/linkabst.cgi?issn=0025-1909&vol=51&iss= &firstpage=614 [CSA]
9. Fumero, F. and Vercellis, C. (1999) Synchronized development of production, inventory, and distribution schedules Transportation Science, 33, pp. 330-340. http://www.csa.com/htbin/linkabst.cgi?issn= 0041-1655&vol=33&iss=&firstpage=330 [CSA]
10. Geismar, H. and Laporte, G. and Lei, L. and Sriskandarajah, C. (2006) The integrated production and transportation scheduling problem with a short life span product and non-instantaneous transportation time INFORMS Journal on Computing. (forthcoming) http://www.csa.com/htbin/ linkabst.cgi?issn=0899-1499&vol=&iss=&firstpage= [CSA]
11. Hall, N. and Potts, C. (2003) Supply chain scheduling: Batching and delivery Operations Research, 51, pp. 566-584. http://dx.doi.org/ 10.1287%2Fopre.51.4.566.16106 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=51&iss=&firstpage=566 [CSA]
12. Julien, F. and Magazine, M. (1990) Scheduling customer orders: An alternative production scheduling approach Journal of Manufacturing and Operations Management, 3, pp. 177-199. http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=3&iss=&firstpage=177 [CSA]
13. Lee, C.-Y. and Chen, Z.-L. (2001) Machine scheduling with transportation considerations Journal of Scheduling, 4, pp. 3-24. http://dx.doi.org/ 10.1002%2F1099-1425%28200101%2F02%294%3A1%3C3%3A%3AAID-JOS57%3E3.0. CO%3B2-D [CROSSREF] http://www.csa.com/htbin/linkabst.cgi?issn= 1094-6136&vol=4&iss=&firstpage=3 [CSA]
14. Lee, C.-Y. and Cheng, T. and Lin, B. (1993) Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem Management Science, 39, pp. 616-625. http://www.csa.com/htbin/linkabst.cgi?issn= 0025-1909&vol=39&iss=&firstpage=616 [CSA]
15. Leung, J. and Li, H. and Pinedo, M. (2005a) Order scheduling in an environment with dedicated resources in parallel Journal of Scheduling, 8, pp. 355-386. http://dx.doi.org/10.1007%2Fs10951-005-2860-x [CROSSREF] http://www.csa.com/htbin/linkabst.cgi?issn=1094-6136&vol=8&iss= &firstpage=355 [CSA]
16. Leung, J. and Li, H. and Pinedo, M. (2005b) Scheduling orders for multiple product types to minimize total weighted completion time. New Jersey Institute of Technology. Working paper
17. Leung, J. and Li, H. and Pinedo, M. (2006a) Scheduling orders for multiple product types with due date related objectives European Journal of Operational Research, 168, pp. 370-389. http://dx.doi.org/ 10.1016%2Fj.ejor.2004.03.030 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=168&iss=&firstpage=370 [CSA]
18. Leung, J. and Li, H. and Pinedo, M. (2006b) Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel Naval Research Logistics, 53, pp. 243-260. http://dx.doi.org/10.1002%2Fnav.20138 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0028-1441&vol=53&iss=&firstpage=243 [CSA]
19. Leung, J. and Li, H. and Pinedo, M. and Sriskandarajah, C. (2005) Open shops with jobs overlap - revisited European Journal of Operational Research, 163, pp. 569-571. http://www.csa.com/htbin/linkabst.cgi?issn= 0377-2217&vol=163&iss=&firstpage=569 [CSA]
20. Leung, J. and Li, H. and Pinedo, M. and Zhang, J. (2005) Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines. New Jersey Institute of Technology. Working paper
21. Li, C.-L. and Ou, J. (2005) Machine scheduling with pickup and delivery Naval Research Logistics, 52, pp. 617-630. http://dx.doi.org/ 10.1002%2Fnav.20101 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0028-1441&vol=52&iss=&firstpage=617 [CSA]
22. Li, C.-L. and Vairaktarakis, G. and Lee, C.-Y. (2005) Machine scheduling with deliveries to multiple customer locations European Journal of Operational Research, 164, pp. 39-51. http://dx.doi.org/ 10.1016%2Fj.ejor.2003.11.022 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=164&iss=&firstpage=39 [CSA]
23. Pundoor, G. and Chen, Z.-L. (2005) Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost Naval Research Logistics, 52, pp. 571-589. http://dx.doi.org/10.1002%2Fnav.20100 [CROSSREF] http://www.csa.com/ htbin/linkabst.cgi?issn=0028-1441&vol=52&iss=&firstpage=571 [CSA]
24. Sarmiento, A. and Nagi, R. (1999) A review of integrated analysis of production-distribution systems IIE Transactions, 31, pp. 1061-1074. http://dx.doi.org/10.1023%2FA%3A1007623508610 [CROSSREF] http://www.csa.com/htbin/linkabst.cgi?issn=0740-817X&vol=31&iss= &firstpage=1061 [CSA]
25. Sung, C. and Yoon, S. (1998) Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines International Journal of Production Economics, 54, pp. 247-255. http://dx.doi.org/ 10.1016%2FS0925-5273%2897%2900151-5 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0925-5273&vol=54&iss=&firstpage=247 [CSA]
26. Wagneur, E. and Sriskandarajah, C. (1993) Open shops with jobs overlap European Journal of Operational Research, 71, pp. 366-378. http://dx.doi.org/10.1016%2F0377-2217%2893%2990347-P [CROSSREF] http://www.csa.com/htbin/linkabst.cgi?issn=0377-2217&vol=71&iss= &firstpage=366 [CSA]
27. Yang, J. (2003) Scheduling parallel machines for the customer order problem with fixed batch sequence Journal of the Korean Institute of Industrial Engineers, 29, pp. 304-311. http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=29&iss=&firstpage=304 [CSA]
28. Yang, J. (2005) The complexity of customer order scheduling problems on parallel machines Computers & Operations Research, 32, pp. 1921-1939. http://www4.infotrieve.com/newmedline/detail.asp?NameID= 17119718&Session=&searchQuery=Computers+%26+Operations+ Research%5BJournal+Name%5D+AND+32%5BVolume%5D+AND+1921%5BPage+Number%5D+ AND+2005%5BPublication+Date%5D+AND+Yang%5BAuthor+Name%5D&count=67544 [INFOTRIEVE] http://dx.doi.org/10.1016%2Fj.cor.2003.12.008 [CROSSREF] http://www.csa.com/htbin/linkabst.cgi?issn=0305-0548&vol=32&iss= &firstpage=1921 [CSA]
29. Yang, J. and Posner, M. (2005) Scheduling parallel machines for the customer order problem Journal of Scheduling, 8, pp. 49-74. http://dx.doi.org/10.1007%2Fs10951-005-5315-5 [CROSSREF] http://www.csa. com/htbin/linkabst.cgi?issn=1094-6136&vol=8&iss=&firstpage=49 [CSA]