A. H. Aalst and . Ter-hofstede, Verification Of Workflow Task Structures: A Petri-net-baset Approach, Information Systems, vol.25, issue.1, pp.43-69, 2000.
DOI : 10.1016/S0306-4379(00)00008-9

A. Aalst and . Ter-hofstede, YAWL: yet another workflow language, Information Systems, vol.30, issue.4, pp.245-275, 2005.
DOI : 10.1016/j.is.2004.02.002

L. Baresi, A. Maurino, and S. Modaeri, Towards Distributed BPEL Orchestrations, Third Workshop on Software Evolution through Transformations: Embracing the Change (SE- TRa'06). Electronic Communications of the EASST, 2006.

]. J. Berk-87, P. Y. Berkey, and . Wang, Two-Dimensional Finite Bin- Packing Algorithms, The Journal of the Operational Research Society, vol.38, p.423429, 1987.

]. B. Berthomieu, P. Ribet, and F. Vernadat, The tool TINA ??? Construction of abstract state spaces for petri nets and time petri nets, International Journal of Production Research, vol.99, issue.14, p.27412756, 2004.
DOI : 10.1137/0216062

B. Bordbar, A. Staikopoulos, and D. J. Brown, On Behavioural Model Transformation in Web Services. Conceptual Modelling for Advanced Application Domain A lower bound for on-line one-dimensional bin packing algorithms, Tech. Rep, p.667678, 1979.

J. Campos, Performance Bounds for Synchronized Queueing Networks, 1990.

D. G. Cattrysse and L. N. Wassenhove, A survey of algorithms for the generalized assignment problem, European Journal of Operational Research, vol.60, issue.3, p.260272, 1992.
DOI : 10.1016/0377-2217(92)90077-M

R. K. and C. Jürgens, Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem

F. R. Chung, M. R. Garey, and D. S. Johnson, On Packing Two-Dimensional Bins, SIAM Journal on Algebraic Discrete Methods, vol.3, issue.1, p.6676, 1982.
DOI : 10.1137/0603007

G. S. Coman and . Lueker, Approximation algorithms for extensible bin packing, Journal of Scheduling, vol.9, pp.63-69, 2006.

R. Cohen, L. Katzir, and D. Raz, An efficient approximation for the Generalized Assignment Problem, Information Processing Letters, vol.100, issue.4, pp.162-166, 2006.
DOI : 10.1016/j.ipl.2006.06.003

J. Csirik and G. J. Woeginger, On-line packing and covering problems, pp.147-177, 1998.
DOI : 10.1007/BFb0029568

M. Dawandea, J. Kalagnanamb, and J. Sethuramanc, Variable Sized Bin Packing With Color Constraints, Decker, R. Dijkman, and M. Dumas. Transforming BPMN Diagrams into YAWL Nets. Business Process Management, p.154157, 2001.
DOI : 10.1016/S1571-0653(04)00248-3

H. Olmo, M. Kellerer, Z. Speranzac, and . Tuza, A 13/12 approximation algorithm for bin packing with extendable bins, Information Processing Letters, vol.65, p.229233, 1998.

R. Dijkman, M. Dumas, and C. Ouyang, Formal semantics and analysis of BPMN process models using Petri nets, Tech. Rep, vol.7115, 2007.

G. Galambos and G. Woeginger, On-line bin packing ? A restricted survey, ZOR Zeitschrift f???r Operations Research Methods and Models of Operations Research, vol.27, issue.1, p.2545, 1995.
DOI : 10.1007/BF01415672

P. Giner, V. Torres, and V. Pelechano, Bridging the Gap between BPMN and WS-BPEL. M2M Transformations in Practice, 3rd International Workshop on Model-Driven Web Engineering, 2007.

K. Jensen, Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, 2003.

]. K. Jensen, L. Kristensen, and L. Wells, Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems, International Journal on Software Tools for Technology Transfer, vol.2, issue.2, p.213254, 2007.
DOI : 10.1007/s10009-007-0038-x

J. Puchinger and G. Raidla, Models and algorithms for threestage two-dimensional bin packing, European Journal of Operational Research, vol.183, p.13041327, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01224921

R. V. Epstein, Online bin packing with resource augmentation, Discrete Optimization, vol.4, p.322333, 2007.
DOI : 10.1016/j.disopt.2007.09.004

URL : http://doi.org/10.1016/j.disopt.2007.09.004

A. Lodi, S. Martello, and M. Monaci, Two-dimensional packing problems: A survey, European Journal of Operational Research, vol.141, issue.2, p.241252, 2002.
DOI : 10.1016/S0377-2217(02)00123-6

A. Lodi, S. Martello, and D. Vigo, Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems, INFORMS Journal on Computing, vol.11, issue.4, p.345357, 1999.
DOI : 10.1287/ijoc.11.4.345

. J. Ga-79-]-d and . Garey, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

S. Martello, D. Pisinger, and D. Vigo, The Three-Dimensional Bin Packing Problem, Operations Research, vol.48, issue.2, p.256267, 2000.
DOI : 10.1287/opre.48.2.256.12386

S. Martello and P. Toth, Knapsack problem algorithms and computer implementation, 1990.

Y. Miyazawa and . Wakabayashi, Two-and three-dimensional parametric packing, Computers & Operations Research, vol.34, p.25892603, 2007.
DOI : 10.1016/j.endm.2005.05.042

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.1684

Z. Nutov, I. Beniaminy, and R. Yuster, A (1???)-approximation algorithm for the generalized assignment problem, Operations Research Letters, vol.34, issue.3, pp.283-288, 2006.
DOI : 10.1016/j.orl.2005.05.006

]. C. Ouya, M. Ouyang, W. Dumas, A. Van-der-aalst, and . Ter-hofstede, From business process models to process-oriented software systems: The BPMN to BPEL way, Tech. Rep, pp.6-27, 2006.

A. Dumas, W. Ter-hofstede, and . Van-der-aalst, Pattern-based translation of bpmn process models to bpel web services, International Journal of Web Services Research, 2007.

C. Petri, Kommunikation mit Automaten, 1962.

S. Polyakovsky and R. Mhallah, An agent-based approach to the two-dimensional guillotine bin packing problem, European Journal of Operational Research, vol.192, issue.3, 2007.
DOI : 10.1016/j.ejor.2007.10.020

D. Prandi, P. Quaglia, and N. Zannone, Coordination Models and Languages, Chap. Formal Analysis of BPMN Via a Translation into COWS, Lecture Notes in Computer Science, vol.5052, p.249263, 2008.

I. Raedts, M. Petkovic, Y. Usenko, J. Der-werf, J. Groote et al., Transformation of BPMN Models for Behaviour Analysis, p.126137, 2007.

J. Recker and J. Mendling, On the Translation between BPMN and BPEL:Conceptual Mismatch between Process Modeling Languages, Proceed-ings 18 th International Conference on Advanced Information Systems Engineering, pp.521-532, 2006.

G. Ross and R. Soland, A branch and bound algorithm for the generalized assignment problem, Save 97] M. Savelsbergh. A Branch-And-Price Algorithm for the Generalized Assignment Problem, pp.91103-831841, 1975.
DOI : 10.1007/BF01580430

]. A. Shra-08a, H. Shraideh, P. Camus, and . Yim, Two stages optimization problem: New variant of Bin Packing Problem for decision making, In: Computer Science and Information Technology, p.921925, 2008.

]. A. Shra-08b, H. C. Shraideh, and . Yim, New generalized assignment problem with identied rst-use bins, VI ALIO/EURO Workshop on Applied Combinatorial Optimization, 2008.

A. Shraideh, H. Camus, and P. Yim, Business Process Optimization by Worfkow Analysis, 22nd International Conference on Computer Applications in Industry and Engineering (CAINE), 2009.

J. Sifakis, Net Theory and Applications, Chap. Performance evaluation of systems using nets, p.307319, 1980.

]. S. Whit-04a and . White, Introduction to BPMN, 2004.

]. S. Whit-04b and . White, Workow Patterns with BPMN and UML, Tech. Rep., IBM, 2004.

S. White, Using BPMN to Model a BPEL Process, BPTrends, vol.3, issue.3, p.118, 2005.

M. Aalst, A. Dumas, N. Ter-hofstede, and . Russell, Pattern-based analysis of BPMN -an extensive evaluation of the control-ow, the data and the resource perspectives, 2005.

J. Ye, S. Sun, W. Song, and L. Wen, Formal Semantics of BPMN Process Models Using YAWL, 2008 Second International Symposium on Intelligent Information Technology Application, p.7074, 2008.
DOI : 10.1109/IITA.2008.68