Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms

References

• Agnetis A, Aloulou MA, Fu L-L (2014) Coordination of production and interstage batch delivery with outsourced distribution. Eur. J. Oper. Res. 238:130–142.Crossref, Google Scholar
• Agnetis A, Aloulou MA, Fu L-L, Kovalyov MY (2015) Two faster algorithms for coordination of production and batch delivery: A note. Eur. J. Oper. Res. 241:927–930.Crossref, Google Scholar
• Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: A review. Oper. Res. 38(1):22–36.Link, Google Scholar
• Boysen N, Bock S, Fliedner M (2013) Scheduling of inventory releasing jobs to satisfy time-varying demand: An analysis of complexity. J. Scheduling 16:185–198.Crossref, Google Scholar
• Chand S, Schneeberger H (1988) Single machine scheduling to minimize weighted earliness subject to no tardy jobs. Eur. J. Oper. Res. 34:221–230.Crossref, Google Scholar
• Chand S, Chhajed D, Traub R (1994) A single-machine scheduling model with fixed-interval deliveries. Production Oper. Management 3:296–307.Crossref, Google Scholar
• Chen T, Qi X, Tu F (1997) Single machine scheduling to minimize weighted earliness subject to maximum tardiness. Comput. Oper. Res. 24:147–152.Crossref, Google Scholar
• Chen Z-L (2010) Integrated production and outbound distribution scheduling: Review and extensions. Oper. Res. 58(1):130–148.Link, Google Scholar
• Chen Z-L, Lee C-Y (2002) Parallel machine scheduling with a common due window. Eur. J. Oper. Res. 136:512–527.Crossref, Google Scholar
• Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper. Res. 8(1):101–111.Link, Google Scholar
• Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, San Francisco).Google Scholar
• Gerstl E, Mosheiov G (2013) Due-window assignment with identical jobs on parallel uniform machines. Eur. J. Oper. Res. 229:41–47.Crossref, Google Scholar
• Gordon V, Proth J-M, Chu C (2002) A survey of the state-of-the-art of common due date assignment and scheduling research. Eur. J. Oper. Res. 139:1–25.Crossref, Google Scholar
• Gordon V, Strusevich V, Dolgui A (2012) Scheduling with due date assignment under special conditions on job processing. J. Scheduling 15:447–456.Crossref, Google Scholar
• Hajiaghaei-Keshteli M, Aminnayeri M, Fatemi Ghomi SMT (2014) Integrated scheduling of production and rail transportation. Comput. Indust. Engrg. 74:240–256.Crossref, Google Scholar
• Hall NG, Posner ME (1991) Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date. Oper. Res. 39(5):836–846.Link, Google Scholar
• Hall NG, Kubiak W, Sethi SP (1991) Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Oper. Res. 39(5):847–856.Link, Google Scholar
• Hall NG, Lesaoana ’M, Potts CN (2001) Scheduling with fixed delivery dates. Oper. Res. 49(1):134–144.Link, Google Scholar
• Janiak A, Janiak WA, Krysiak T, Kwiatkowski T (2015) A survey on scheduling problems with due windows. Eur. J. Oper. Res. 242:347–357.Crossref, Google Scholar
• Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2:83–97.Crossref, Google Scholar
• Lee C-Y, Li C-L (1996) On the fixed interval due-date scheduling problem. Discrete Appl. Math. 68:101–117.Crossref, Google Scholar
• Leung JY-T, Chen Z-L (2013) Integrated production and distribution with fixed delivery departure dates. Oper. Res. Lett. 41:290–293.Crossref, Google Scholar
• Li K, Sivakumar AI, Ganesan VK (2008) Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain. Eur. J. Oper. Res. 187:442–455.Crossref, Google Scholar
• Ma HL, Chan Felix TS, Chung SH (2013) Minimising earliness and tardiness by integrating production scheduling with shipping information. Internat. J. Production Res. 51:2253–2267.Crossref, Google Scholar
• Matsuo H (1988) The weighted total tardiness problem with fixed shipping times and overtime utilization. Oper. Res. 36(2):293–307.Link, Google Scholar
• Melo RA, Wolsey LA (2010) Optimizing production and transportation in a commit-to-delivery business mode. Eur. J. Oper. Res. 203:614–618.Crossref, Google Scholar
• Pathumnakul S, Egbelu PJ (2005) Algorithm for minimizing weighted earliness penalty in single-machine problem. Eur. J. Oper. Res. 161:780–796.Crossref, Google Scholar
• Seddik Y, Gonzales C, Kedad-Sidhoum S (2013) Single machine scheduling with delivery dates and cumulative payoffs. J. Scheduling 16:313–329.Crossref, Google Scholar
• Sidney JB (1977) Optimal single-machine scheduling with earliness and tardiness penalties. Oper. Res. 25(1):62–69.Link, Google Scholar
• Sourd F (2009) New exact algorithms for one-machine earliness-tardiness scheduling. INFORMS J. Comput. 21(1):167–175.Link, Google Scholar
• Stecke KE, Zhao X (2007) Production and transportation integration for a make-to-order manufacturing company with a commit-to-delivery business mode. Manufacturing Service Oper. Management 9(2):206–224.Link, Google Scholar
• Valente JMS (2006) Local and global dominance conditions for the weighted earliness scheduling problem with no idle time. Comput. Indust. Engrg. 51:765–780.Crossref, Google Scholar
• van den Akker M, Hoogeveen H, van de Velde S (2002) Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem. INFORMS J. Comput. 14(1):37–51.Link, Google Scholar
• Wan G, Yen BP-C (2009) Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs. Eur. J. Oper. Res. 195:89–97.Crossref, Google Scholar
• Wolsey LA (1998) Integer Programming (John Wiley & Sons, New York).Google Scholar
• Yang X (2000) Scheduling with generalized batch delivery dates and earliness penalties. IIE Trans. 32:735–741.Crossref, Google Scholar
• Zhong W, Chen Z-L, Chen M (2010) Integrated production and distribution scheduling with committed delivery dates. Oper. Res. Lett. 38:133–138.Crossref, Google Scholar