Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)
DOI: 10.1109/cec.2000.870309
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithms for multiobjective scheduling of combined batch/continuous process plants

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…Vulcanization workshop scheduling is a typical NP-hard problem. At present, there are many algorithms studying on the vulcanization workshop scheduling, such as Wu proposed a heuristic based on the decomposition method to solve large-scale scheduling problem [1]; Harjunkoski and Grossmann proposed a methods of mathematical programming decomposition strategy to solve large-scale scheduling problem [2]; Shaw, introduce a genetic algorithms to search for scheduling mixed batch and continuous solution [3]; Moon and Murakami use a simulated annealing algorithm for solving the batch scheduling problem [4], and so on.…”
Section: Introductionmentioning
confidence: 99%
“…Vulcanization workshop scheduling is a typical NP-hard problem. At present, there are many algorithms studying on the vulcanization workshop scheduling, such as Wu proposed a heuristic based on the decomposition method to solve large-scale scheduling problem [1]; Harjunkoski and Grossmann proposed a methods of mathematical programming decomposition strategy to solve large-scale scheduling problem [2]; Shaw, introduce a genetic algorithms to search for scheduling mixed batch and continuous solution [3]; Moon and Murakami use a simulated annealing algorithm for solving the batch scheduling problem [4], and so on.…”
Section: Introductionmentioning
confidence: 99%