References
- Al-Yakoob, S. M. 1997. “Mixed-integer Mathematical Programming Optimization Models and Algorithms for an Oil Tanker Routing and Scheduling Problem.” PhD diss., Virginia Polytechnic Institute and State University.
- Andersson, H., A. Hoff, M. Christiansen, and A. Lokketangen. 2010. “Industrial Aspects and Literature Review: Combined Inventory Management and Routing.” Computers & Operations Research 37: 1515–1536.
- Balas, E. 1975. “Facets of the Knapsack Polytope.” Mathematical Programming 8: 146–164.
- Balas, E., and E. Zemel. 1978. “Facets of the Knapsack Polytope from Minimal Covers.” SIAM Journal on Applied Mathematics 34 (1): 119–148.
- Camponogara, E., and P. H. R. Nakashima. 2006. “Optimizing Gas-lift Production of Oil Wells: Piecewise-linear Formulation and Computational Analysis.” IIE Transactions 38 (2): 173–182.
- Camponogara, E., L. F. Nazari, and C. N. Meneses. 2012. “A Revised Model for Compressor Design and Scheduling in Gas-lifted Oil Fields.” IIE Transactions 44: 342–351.
- Camponogara, E., and A. Plucenio. 2013. AMPL Instances of Shuttle Tanker Scheduling Problem. http://www.das.ufsc.br/~camponog/Oil-Tankers.
- Crowder, H., E. L. Johnson, and M. Padberg. 1983. “Solving Large-scale Zero-one Linear Programming Problems.” Operations Research 31 (5): 803–834.
- Dillenberger, C., L. F. Escudero, A. Wollensak, and W. Zhang. 1994. “On Practical Resource Allocation for Production Planning and Scheduling with Period Overlapping Setups.” European Journal of Operational Research 75: 275–286.
- Fisher, M. L. 1985. “An Applications Oriented Guide to Lagrangian Relaxation.” Interfaces 15 (2): 10–21.
- Fleischmann, B. 1990. “The Discrete Lot-sizing and Scheduling Problem.” European Journal of Operational Research 44: 337–348.
- Fourer, R., D. M. Gay, andB. W. Kernighan. 2003. A Modeling Language for Mathematical Programming. Lincoln: Thomson.
- Geoffrion, A. M. 1974. “Lagrangean Relaxation for Integer Programming.” Mathematical Programming Study 2: 82–114.
- Gicquel, G., L. A. Wolsey, and M. Minoux. 2012. “On Discrete Lot-sizing and Scheduling on Identical Parallel Machines.” Optimization Letters 6: 545–557.
- Jetlund, A. S., and I. A. Karimi. 2004. “Improving the Logistics of Multi-compartment Chemical Tankers.” Computers and Chemical Engineering 28: 1267–1283.
- Kobayashi, K., and M. Kubo. 2010. “Optimization of Oil Tanker Schedules by Decomposition.” Japan Journal of Industrial and Applied Mathematics 27: 161–173.
- Mohammadi, M., S. M. T. F. Ghomi, B. Karimi, and S. A. Torabi. 2010. “Rolling-horizon and Fix-and-relax Heuristics for the Multi-product Multi-level Capacitated Lotsizing Problem with Sequence-dependent Setups.” Journal of Intelligent Manufacturing 21: 501–510.
- Morton, T. E., and D. W. Pentico. 1993. Heuristic Scheduling Systems. New York: John Wiley & Sons.
- Nemhauser, G., and L. Wolsey. 1999. Integer and Combinatorial Optmization. New York: John Wiley & Sons.
- Sherali, H. D., S. M. Al-Yakoob, and M. M. Hassan. 1999. “Fleet Management Models and Algorithms for an Oil-tanker Routing and Scheduling Problem.” IIE Transactions 31 (5): 395–406.
- Silva, T. L., and E. Camponogara. 2014. “A Computational Analysis of Multidimensional Piecewise-linear Models with Applications to Oil Production Optimization.” European Journal of Operational Research 232: 630–642.
- Wolsey, L. 1998. Integer Programming. John Wiley & Sons.