An improved particle swarm algorithm for batch splitting flexible job shop scheduling

zbMATH Open1265.90136MaRDI QIDQ4900657FDOQ4900657

Authors:

Publication date: 24 January 2013

Recommendations

• Applications of discrete particle swarm optimization in solving the job-shop scheduling problems
• A particle swarm optimization algorithm for job-shop scheduling problem
• Study on particle swarm algorithm for job shop scheduling problems
• Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem
• Job-shop scheduling based on improved particle swarm

zbMATH Keywords

simulated annealingparticle swarm algorithmflexible job-shop schedulingthe batch splitting scheduling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cited In (3)

• Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem
• A new parallel algorithm based on DE for batch splitting job shop scheduling under multiple-resource constraints
• Improved bat algorithm for job shop scheduling problem

This page was built for publication: An improved particle swarm algorithm for batch splitting flexible job shop scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4900657)