Supply chain scheduling with receiving deadlines and non-linear penalty

Journal of the Operational Research Society

Volumn 66, Issue 3, 2015, Pages 380-391

  Wang, Gang ^a   Lei, Lei ^b   Lee, Kangbok ^c  

^a KEAN UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

capacitated facilities; deadline constraints; dynamic programming; Operations scheduling; pseudo polynomial time algorithm

Indexed keywords

COST FUNCTIONS; MICROCOMPUTERS; POLYNOMIAL APPROXIMATION; SALES; SCHEDULING; SHIPS; SUPPLY CHAINS;

CAPACITATED FACILITIES; COMPUTATIONAL PERFORMANCE; DEADLINE CONSTRAINT; OPERATIONS SCHEDULING; PSEUDO-POLYNOMIAL TIME ALGORITHMS; SEMI-FINISHED PRODUCTS; SUPPLY CHAIN SCHEDULING; THREE-STAGE SUPPLY CHAIN;

DYNAMIC PROGRAMMING;

EID: 84961357135     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2014.2     Document Type: Article

References (18)

1. Ahuja RK, Magnanti TL and Orlin JB (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall: Upper Saddle River, NJ.
2. Alpan G, Ladier AL, Larbi R and Penz B (2011). Heuristic solutions for transshipment problems in a multiple door cross docking warehouse. Computers & Industrial Engineering 61(2): 402-408.
3. Bard JF and Nananukul N (2009). The integrated production-inventorydistribution-routing problem. Journal of Scheduling 12(3): 257-280.
4. Bertazzi L and Zappa O (2012). Integrating transportation and production: An international study case. Journal of the Operational Research Society 63(7): 920-930.
5. Brotcorne L, Hanafi S and Mansi R (2009). A dynamic programming algorithm for the bi-level knapsack problem. Operations Research Letters 37(3): 215-218.
6. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company: New York.
7. Guinet A (2001). Multi-site planning: A transshipment problem. International Journal of Production Economics 74(1-3): 21-32.
8. Kannegiesser M and Günther H-O (2011). An integrated optimization model for managing the global value chain of a chemical commodities manufacturer. Journal of the Operational Research Society 62(4): 711-721.
9. Kaushik A (2008). Offshore Outsourcing: Quantifying ROI, CIO Magazine, 4 November.
10. Kellerer H and Pferschy U (2004). Improved dynamic programming in connection with an FPTAS for the knapsack problem. Journal of Combinatorial Optimization 8(1): 5-11.
11. Kellerer H, Pferschy U and Pisinger D (2004). Knapsack Problems. Springer-Verlag: Berlin/Heidelberg: p 16.
12. Korte B and Vyen J (2006). Combinatorial Optimization Theory and Algorithms, 3rd edn. (Chapter 5) Springer: Germany.
13. Leach PT (2012). Logistics challenges force shippers to think outside the box. The Journal of Commerce. 7 May, http://www.joc.com/portsterminals/outside-box, accessed 8 August 2012.
14. Lei L, Zhong H and Chaovalitwongse WA (2009). On the integrated production and distribution problem with bidirectional flows. INFORMS Journal on Computing 21(4): 585-598.
15. Martello S, Pisinger D and Toth P (1999). Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science 45(3): 414-424
16. McKinsey (2010). McKinsey Global Survey Results: The challenges ahead for supply chains, McKinsey Quarterly November, http://www .mckinseyquarterly.com/The-challenges-ahead-for-supply-chains-McKinsey-Global-Survey-results-2706, accessed 8 August 2012.
17. Wang G and Lei L (2012). Polynomial-time solvable cases of the capacitated multi-echelon shipping network scheduling problem with delivery deadlines. International Journal of Production Economics 2(137): 263-271.
18. Yan SY, Juang DS, Chen CR and Lai WS (2005). Global and local search algorithms for concave cost transshipment problems. Journal of Global Optimization 33(1): 123-156.