Solving planning and scheduling problems with combined integer and constraint programming

OR Spectrum

Volumn 24, Issue 4, 2002, Pages 431-448

  Timpe, Christian ^a  

^a BASF SE   (Germany)

Author keywords

Decision support systems; Hybrid methods; Production planning; Scheduling

Indexed keywords

EID: 0442268855     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00291-002-0107-1     Document Type: Article

References (15)

1. Aggoun A, Beldiceanu N (1993) Extending CHIP in order to solve complex scheduling problems. Journal of Mathematical and Computer Modelling 17(7): 57-73
2. Belvaux G, Wolsey LA (1999) Lot-sizing problems: modelling issues and a specialised branch-and-cut system bc-prod. CORE Discussion Paper 9849 09/1998. Université Catholique de Louvain, Louvain-la-Neuve, Belgium
3. Berning G, Brandenburg M, Gürsoy K, Mehta V, Tölle FJ (2002) An integrated system solution for supply chain optimization in the chemical process industry. OR Spectrum 24: 371-401
4. Bockmayr A, Kasper T (1998) Branch-and-infer: A unifying framework for integer and finite domain constraint programming. Informs Journal of Computing 10(3): 287-300
5. Bockmayr A, Pisaruk N (2001) Solving assembly line balancing problems by combining IP and CP. Proceedings of the 6th Annual Workshop of the ERCIM Group on Constraints, Prague (http://arXiv.org/abs/cs.DM/0106002)
6. Dincbas M, Van Hentenryck P, Simonis H, Aggoun A, Graf T, Berthier F (1998) The constraint logic programming language CHIP. In: Proceedings of International Conference on Fifth Generation Computer Systems (FGCS-88), Tokyo, pp 693-702
7. Grunow M, Günther HO, Lehmann M (2002) Campaign planning for multi-stage batch processes in the chemical industry. OR Spectrum 24: 281-314
8. Heipcke S (1999) Combined modeling and problem solving in mathematical programming and constraint programming. Doctoral Thesis, University of Buckingham
9. Hooker JN, Kim HJ, Ottosson G (1998) A declarative modeling framework that integrates solution methods. Annals of Operations Research 104: 141-161
10. Hooker JN, Ottosson G, Thorsteinsson ES, Kim HJ (1999) On integrating constraint propagation and linear programming for combinatorial optimization. Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), The AAAI Press/The MIP Press, pp 136-141
11. Jain V, Grossmann IE (2001) Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS Journal of Computing 13: 258-276
12. Kallrath J (2002) Planning and scheduling in the process industry. OR Spectrum 24: 219-250
13. Marriot K, Stuckey PJ (1998) Programming with constraints. MIT Press, New York
14. Nemhauser GI, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York
15. Neumann K, Schwindt C, Trautmann N (2002) Advanced production scheduling for batch plants in process industries. OR Spectrum 24: 251-279