Comparative study of different approaches to solve batch process scheduling and optimisation problems

Yaqing Tan; Wei Huang; Yanming Sun; Yong Yue

Comparative study of different approaches to solve batch process scheduling and optimisation problems

Yaqing Tan^*, Wei Huang, Yanming Sun, Yong Yue

^*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

1 Citation (Scopus)

Abstract

Effective approaches are important to batch process scheduling problems, especially those with complex constraints. However, most research focus on improving optimisation techniques, and those concentrate on comparing their difference are inadequate. This study develops an optimisation model of batch process scheduling problems with complex constraints and investigates the performance of different optimisation techniques, such as Genetic Algorithm (GA) and Constraint Programming (CP). It finds that CP has a better capacity to handle batch process problems with complex constraints but it costs longer time.

Original language	English
Title of host publication	ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing
Subtitle of host publication	Integration of Design and Engineering
Pages	248-253
Number of pages	6
Publication status	Published - 2012
Externally published	Yes
Event	18th International Conference on Automation and Computing, ICAC 2012 - Loughborough, Leicestershire, United Kingdom Duration: 7 Sept 2012 → 8 Sept 2012

Publication series

Name	ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering

Conference

Conference	18th International Conference on Automation and Computing, ICAC 2012
Country/Territory	United Kingdom
City	Loughborough, Leicestershire
Period	7/09/12 → 8/09/12

Keywords

Constraint Programming (CP)
Gwnetic Algorithm (GA)
batch process scheduling
comparative study

Cite this

Tan, Y., Huang, W., Sun, Y., & Yue, Y. (2012). Comparative study of different approaches to solve batch process scheduling and optimisation problems. In ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering (pp. 248-253). Article 6330519 (ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering).

Tan, Yaqing ; Huang, Wei ; Sun, Yanming et al. / Comparative study of different approaches to solve batch process scheduling and optimisation problems. ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering. 2012. pp. 248-253 (ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering).

@inproceedings{7faedef912b8451094298861fbbc1046,

title = "Comparative study of different approaches to solve batch process scheduling and optimisation problems",

abstract = "Effective approaches are important to batch process scheduling problems, especially those with complex constraints. However, most research focus on improving optimisation techniques, and those concentrate on comparing their difference are inadequate. This study develops an optimisation model of batch process scheduling problems with complex constraints and investigates the performance of different optimisation techniques, such as Genetic Algorithm (GA) and Constraint Programming (CP). It finds that CP has a better capacity to handle batch process problems with complex constraints but it costs longer time.",

keywords = "Constraint Programming (CP), Gwnetic Algorithm (GA), batch process scheduling, comparative study",

author = "Yaqing Tan and Wei Huang and Yanming Sun and Yong Yue",

year = "2012",

language = "English",

isbn = "9781908549006",

series = "ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering",

pages = "248--253",

booktitle = "ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing",

note = "18th International Conference on Automation and Computing, ICAC 2012 ; Conference date: 07-09-2012 Through 08-09-2012",

}

Tan, Y, Huang, W, Sun, Y & Yue, Y 2012, Comparative study of different approaches to solve batch process scheduling and optimisation problems. in ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering., 6330519, ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering, pp. 248-253, 18th International Conference on Automation and Computing, ICAC 2012, Loughborough, Leicestershire, United Kingdom, 7/09/12.

Comparative study of different approaches to solve batch process scheduling and optimisation problems. / Tan, Yaqing; Huang, Wei; Sun, Yanming et al.
ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering. 2012. p. 248-253 6330519 (ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering).

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

TY - GEN

T1 - Comparative study of different approaches to solve batch process scheduling and optimisation problems

AU - Tan, Yaqing

AU - Huang, Wei

AU - Sun, Yanming

AU - Yue, Yong

PY - 2012

Y1 - 2012

N2 - Effective approaches are important to batch process scheduling problems, especially those with complex constraints. However, most research focus on improving optimisation techniques, and those concentrate on comparing their difference are inadequate. This study develops an optimisation model of batch process scheduling problems with complex constraints and investigates the performance of different optimisation techniques, such as Genetic Algorithm (GA) and Constraint Programming (CP). It finds that CP has a better capacity to handle batch process problems with complex constraints but it costs longer time.

AB - Effective approaches are important to batch process scheduling problems, especially those with complex constraints. However, most research focus on improving optimisation techniques, and those concentrate on comparing their difference are inadequate. This study develops an optimisation model of batch process scheduling problems with complex constraints and investigates the performance of different optimisation techniques, such as Genetic Algorithm (GA) and Constraint Programming (CP). It finds that CP has a better capacity to handle batch process problems with complex constraints but it costs longer time.

KW - Constraint Programming (CP)

KW - Gwnetic Algorithm (GA)

KW - batch process scheduling

KW - comparative study

UR - http://www.scopus.com/inward/record.url?scp=84869429124&partnerID=8YFLogxK

M3 - Conference Proceeding

AN - SCOPUS:84869429124

SN - 9781908549006

T3 - ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering

SP - 248

EP - 253

BT - ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing

T2 - 18th International Conference on Automation and Computing, ICAC 2012

Y2 - 7 September 2012 through 8 September 2012

ER -

Tan Y, Huang W, Sun Y, Yue Y. Comparative study of different approaches to solve batch process scheduling and optimisation problems. In ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering. 2012. p. 248-253. 6330519. (ICAC 12 - Proceedings of the 18th International Conference on Automation and Computing: Integration of Design and Engineering).

Comparative study of different approaches to solve batch process scheduling and optimisation problems

Abstract

Publication series

Conference

Keywords

Other files and links

Cite this