scientific article; zbMATH DE number 1054937

MaRDI QIDQ4350051zbMATH OpenFDO

Authors Takeshi Yamada, Ryohei Nakano

Publication date 28 August 1997

zbMATH Keywords

simulated annealingstochastic local searchshifting bottleneckjob-shop scheduling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Job Shop Scheduling by Local Search
• Some new results on simulated annealing applied to the job shop scheduling problem
• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• A very fast TS/SA algorithm for the job shop scheduling problem
• Job Shop Scheduling by Simulated Annealing

Cited in

(13)

• Evolutionary job scheduling with optimized population by deep reinforcement learning
• Ant colony optimization combined with taboo search for the job shop scheduling problem
• Optimization based job shop scheduling
• A prediction based iterative decomposition algorithm for scheduling large-scale job shops
• A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
• Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
• Artificial Intelligence and Soft Computing - ICAISC 2004
• Rescheduling railway traffic on real time situations using time-interval variables
• A novel threshold accepting meta-heuristic for the job-shop scheduling problem
• Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem
• Deterministic job-shop scheduling: Past, present and future
• Efficient local search algorithms for job-shop scheduling problems
• Metaheuristics: A bibliography

Describes a project that uses

Uses Software

• JOBSHOP

This page was built for publication:

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