Multi-stage ordinal optimization based approach for job shop scheduling problems

DOI10.1016/j.amc.2012.07.020zbMath1286.90073MaRDI QIDQ2449225

Shin-Yeu Lin, Shih-Cheng Horng

Publication date: 7 May 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.07.020

zbMATH Keywords

ordinal optimization; earliness; genetic algorithm; tardiness; artificial neural network; stochastic classical job shop scheduling

Mathematics Subject Classification ID

90B36: Stochastic scheduling theory in operations research

Related Items

A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties

Cites Work

• An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
• Nonmonotone BFGS-trained recurrent neural networks for temporal sequence processing
• Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem
• Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline
• Multilayer feedforward networks are universal approximators
• Vector ordinal optimization
• Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time
• A hybrid method for solving stochastic job shop scheduling problems
• Stochastic Scheduling with Release Dates and Due Dates
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime