Scheduling of Jobs on Dissimilar Parallel Machine Using Computational Intelligence Algorithms

DOI10.1007/978-3-030-26458-1_24zbMath1436.90166OpenAlexW2999081817MaRDI QIDQ3296266

Prakash Kotecha, Remya Kommadath

Publication date: 7 July 2020

Published in: Nature-Inspired Methods for Metaheuristics Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-26458-1_24

zbMATH Keywords

schedulinggenetic algorithmdifferential evolutionparticle swarm optimizationartificial bee colonyteaching-learning based optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• WCA

Cites Work

• Unnamed Item
• On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation
• Approximation algorithms for scheduling unrelated parallel machines
• A hybrid method for the planning and scheduling
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
• Cyclic scheduling to minimize inventory in a batch flow line
• Effective neighbourhood functions for the flexible job shop problem
• A survey of scheduling problems with setup times or costs
• A genetic algorithm for the flexible job-shop scheduling problem
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes

This page was built for publication: Scheduling of Jobs on Dissimilar Parallel Machine Using Computational Intelligence Algorithms