A 0–1 LP Model for the Integration and Consolidation of Air Cargo Shipments

Published Online:https://doi.org/10.1287/opre.1080.0583

References

  • Antonio L., Lorena N., Narciso M. G. Relaxation heuristics for a generalized assignment problem. Eur. J. Oper. Res. (1995) 91:600–610Google Scholar
  • Balas E., Martin C. H. Pivot and complement—A heuristic for 0–1 programming. Management Sci. (1980) 26:86–96LinkGoogle Scholar
  • Balas E., Ceria S., Cornuejols G. Mixed 0–1 programming by lift-and-project in a branch-and-cut framework. Management Sci. (1996) 42(9):1229–1246LinkGoogle Scholar
  • Belhe U., Kusiak A. Dynamic scheduling of design activities with resource constraints. IEEE Trans. SMC Part A: Systems and Humans (1997) 27(1):105–111CrossrefGoogle Scholar
  • Bertazzi L., Speranza M. G., Ukovich W. Exact and heuristic solutions for a shipment problem with given frequencies. Management Sci. (2000) 46(7):973–988LinkGoogle Scholar
  • Bookbinder J. H., Higginson J. K. Probabilistic modeling of freight consolidation by private carriage. Transportation Res. Part E: Logist. Transportation Rev. (2002) 38(5):305–318CrossrefGoogle Scholar
  • Chang S., Tcha D. A heuristic for multiple choice programming. Comput. Oper. Res. (1985) 12(1):25–37CrossrefGoogle Scholar
  • Chiu H. N. The integrated logistics management system: A framework and case study. Internat. J. Physical Distribution Logist. Management (1995) 25(6):4–22CrossrefGoogle Scholar
  • Crowder H., Johnson E., Padberg M. Solving larger-scale zero-one linear programming problems. Oper. Res. (1983) 31(5):803–834LinkGoogle Scholar
  • D'Alfonso T. H., Ventura J. A. Assignment of tools to machines in a flexible manufacturing system. Eur. J. Oper. Res. (1995) 81:115–133CrossrefGoogle Scholar
  • De Farias I. R., Johnson E. L., Nemhauser G. L. A generalized assignment problem with special ordered sets: A polyhedral approach. Math. Programming Ser. A (2000) 89:187–203CrossrefGoogle Scholar
  • Dobson G., Nambimadom R. S. The batch loading and scheduling problem. Oper. Res. (2001) 49(1):52–65LinkGoogle Scholar
  • Hall R. W. Consolidation strategy: Inventory, vehicles and terminals. J. Bus. Logist. (1987) 8(2):57–73Google Scholar
  • Kaku B. K., Thompson G. L. An exact algorithm for the general quadratic assignment problem. Eur. J. Oper. Res. (1986) 23:383–389CrossrefGoogle Scholar
  • Katok E., Lewis H. S., Harrison T. P. Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources. Management Sci. (1998) 44(6):859–877LinkGoogle Scholar
  • Lee D. H., Kim Y. D. Loading algorithms for flexible manufacturing systems with partially grouped machines. IIE Trans. (2000) 32(1):33–47CrossrefGoogle Scholar
  • Lee D. H., Kiritsis D., Xirouchakis P. Branch and fathoming algorithms for operation sequencing in process planning. Internat. J. Production Res. (2001) 39(8):1649–1669CrossrefGoogle Scholar
  • Lee H. L., Billington C. The evolution of supply-chain-management models and practice at Hewlett-Packard. Interfaces (1995) 25(5):42–63LinkGoogle Scholar
  • Leung L. C., Cheung W., Hui Y. V. A framework for a logistics e-commerce community network: The Hong Kong air cargo industry. IEEE Trans. System, Man, Cybernetics (2000) 30(4):446–455CrossrefGoogle Scholar
  • Madan M. S., Gilbert K. C. An exact solution algorithm for a class of production planning and scheduling problems. J. Oper. Res. Soc. (1992) 43(10):961–970CrossrefGoogle Scholar
  • Maes J., McClain J. O., Van Wassenhove L. N. Multilevel capacitated lot sizing complexity and LP-based heuristics. Eur. J. Oper. Res. (1991) 53:131–148CrossrefGoogle Scholar
  • Padberg M., Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. (1991) 33(1):60–100CrossrefGoogle Scholar
  • Pooley J., Stenger A. J. Modeling and evaluating shipment consolidation in a logistics system. J. Bus. Logist. (1992) 13(2):153–174Google Scholar
  • Popken D. A. An algorithm for the multiattribute, multicommodity flow problem with freight consolidation and inventory costs. Oper. Res. (1994) 42(2):274–286LinkGoogle Scholar
  • Razzaque M. A., Sheng C. C. Outsourcing of logistics functions: A literature survey. Internat. J. Physical Distribution Logist. Management (1998) 28(2):89–107CrossrefGoogle Scholar
  • Sheffi Y. Carrier/shipper interaction in the transportation market: An analytic framework. J. Bus. Logist. (1986) 7(1):1–27Google Scholar
  • Sowinski L. Supply chain management with the click of a mouse. World Trade (1999) 12(12):58–60Google Scholar
  • Sun X., Noble J. S., Klein C. M. Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Trans. (1999) 31(2):113–124CrossrefGoogle Scholar
  • Van Roy T. J., Wolsey L. A. Solving mixed integer programming problems using automatic reformulation. Oper. Res. (1987) 35(1):45–57LinkGoogle Scholar
  • Williams L. R., Nibbs A., Irby D., Finley T. Logistics integration: The effect of information technology, team composition, and corporate competitive positioning. J. Bus. Logist. (1997) 18(2):31–41Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.