1 Lundgren, M.G., Lundgren, J.T., Persson, J.A., “An optimization model for refinery production scheduling”, Int. J. Prod. Econ., 78, 255-270 (2002). 2 Pinto, J.M., Joly, M., Moro, L.F.L., “Planning and scheduling models for refinery operations”, Comput. Chem. Eng., 24, 2259-2276 (2000). 3 Zhang, N., Zhu, X.X., “A novel modelling and decomposition strategy for overall refinery optimization”, Comput. Chem. Eng., 24, 1543-1548 (2000). 4 Lambrecht, M.R., Vanderveken, H., “Heuristics procedures for the single operation, multi-item loading problem”, AIIE Trans., 11, 319-326 (1979). 5 Dixon, P.S., Silver, E.A., “A heuristics solution procedure for multi-item, single-level, limited capacity, lot-sizing problem”, J. Oper. Manag., 2, 23-39 (1981). 6 Thizy, J.M., van Wassenhove, L.N., “Lagrangian relaxation for the multi-item capacitated lot-sizing problem, a heuristics approach”, AIIE Trans., 17, 308-313 (1985). 7 Savelsbergh, M.W.P., “A branch-and-price algorithm for the generalized assignment problem”, Oper. Res., 45, 831-841 (1997). 8 Desrochers, M., Desrosiers, J., Soloman, M., “A new optimization algorithm for the vehicle routing problem with time windows”, Oper. Res., 40, 342-354 (1992). 9 Vance, P.H., “Branch-and-price algorithms for the one-dimensional cutting stock problem”, Comput. Opt. Appl., 9, 211-228 (1998). 10 Cattrysse, D., Maes, J., van Wassenhove, L.N., “Set partitioning and column generation heuristic for capacitated dynamic lot-sizing”, Eur. J. Oper. Res., 46, 38-47 (1990). 11 Nemhauser, G.L., Wolsey, L.A., Integer and Combinatorial Optimization, Wiley, Chichester, UK (1988). |