2011
DOI: 10.1177/1063293x11425192
|View full text |Cite
|
Sign up to set email alerts
|

The Batch Machine Scheduling of Continuous Caster with Flexible Jobs to Minimize Setup Costs

Abstract: The batch machine scheduling of continuous caster with flexible jobs is first proposed based on its character. The difference with classical problem is first summarized. The preprocess of the problem based on rule is proposed, and then the mathematical model with minimizing setup costs is proposed. To improve the efficiency of local search, the particle swarm optimization (PSO) is introduced, and then the PSO combined with heuristic is embedded into the iterated local search (ILS) to solve the problem. The sol… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 14 publications
(21 reference statements)
0
4
0
Order By: Relevance
“…The PSO algorithm has been widely used to solve optimization problems owing to its low complexity and excellent performance. Yu and Huang (2011) proposed a PSO algorithm combined with iterated local search to solve the batch machine scheduling problem. Behnamian (2014) presented a discrete particle swarm optimization (DPSO) algorithm to minimize the fuzzy makespan using a parallel machine scheduling model.…”
Section: Relevant Literaturementioning
confidence: 99%
“…The PSO algorithm has been widely used to solve optimization problems owing to its low complexity and excellent performance. Yu and Huang (2011) proposed a PSO algorithm combined with iterated local search to solve the batch machine scheduling problem. Behnamian (2014) presented a discrete particle swarm optimization (DPSO) algorithm to minimize the fuzzy makespan using a parallel machine scheduling model.…”
Section: Relevant Literaturementioning
confidence: 99%
“…Because the parameters of due date, upper bound, portion of agent 1, and learning effect vary, there are many local minimums in the solution space. Consequently, general-purpose evolutionary algorithms and local searches will be easily trapped in the local minimums (Ji et al, 2013; Yu and Huang, 2011). Therefore, particular scheduling algorithms are called for.…”
Section: Problem Descriptionmentioning
confidence: 99%
“…For the analysis of an automated manufacturing system, simulation technology has been considered as an essential tool (Iwata et al, 1995). Simulation is useful for calculating utilization statistics, finding bottlenecks, pointing out scheduling errors, and even for creating manufacturing schedules (Yu and Huang, 2011).…”
Section: Introductionmentioning
confidence: 99%