Solving composite scheduling problems using the hybrid genetic algorithm

DOI10.1631/JZUS.A1001136zbMath1400.90175MaRDI QIDQ1622412

Mitsumasa Sugawara, Azuma Okamoto

Publication date: 19 November 2018

Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)

zbMATH Keywords

hybrid genetic algorithmmanufacturing schedulingcomposite schedulingtransportation routing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites Work

• Complexity of flow shop scheduling problems with transportation constraints
• Advanced planning and scheduling based on precedence and resource constraints for e-plant chains
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Machine scheduling with transportation considerations

This page was built for publication: Solving composite scheduling problems using the hybrid genetic algorithm