Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
From MaRDI portal
Publication:260652
DOI10.1007/S12597-013-0159-9zbMATH Open1332.90112OpenAlexW2026155461MaRDI QIDQ260652FDOQ260652
Authors: H. S. Keesari, R. V. Rao
Publication date: 22 March 2016
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-013-0159-9
Recommendations
- Improved teaching-learning-based optimization algorithm for solving job shop scheduling problem
- A Novel Heuristic Approach for Job Shop Scheduling Problem
- A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems
- scientific article; zbMATH DE number 6960966
- Hybridization of ant colony optimization strategies in tabu search for solving job shop scheduling problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- OR-Library
- A Computational Study of the Job-Shop Scheduling Problem
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
- Variable neighbourhood search: Methods and applications
- A new hybrid genetic algorithm for job shop scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- A Global Interpolator With Low Sample Rate for Multilevel Fast Multipole Algorithm
- An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
- A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
Cited In (6)
- Hybridization of ant colony optimization strategies in tabu search for solving job shop scheduling problems
- Teaching-learning-based optimization with learning enthusiasm mechanism and its application in chemical engineering
- A Novel Heuristic Approach for Job Shop Scheduling Problem
- Chemical reaction optimization algorithm for machining parameter of abrasive water jet cutting
- Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm
- Title not available (Why is that?)
Uses Software
This page was built for publication: Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q260652)