Genetic Simulated-Annealing Algorithm for Robust Job Shop Scheduling

DOI10.1007/978-3-642-03664-4_89MaRDI QIDQ3563262zbMATH OpenOpenAlexFDO

Authors Bing Wang, Qiaoyun Li, Xiaofei Yang

Publication date 31 May 2010

Published in Advances in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03664-4_89

zbMATH Keywords

genetic simulated annealing algorithmjob shop scheduling problemscenario approachuncertain processing times

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• An analogue genetic algorithm for solving job shop scheduling problems
• scientific article; zbMATH DE number 4115948
• A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
• scientific article; zbMATH DE number 1174531
• A genetic algorithm for the flexible job-shop scheduling problem
• A genetic algorithm based procedure for more realistic job shop scheduling problems
• A hybrid genetic algorithm for the job shop scheduling problem
• A genetic algorithm for the job shop problem
• Heuristic genetic algorithm for job shop scheduling problem
• A genetic algorithm applied to a classic job-shop scheduling problem

Cited in

(6)

• A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
• Chance-constrained model for uncertain job shop scheduling problem
• An analogue genetic algorithm for solving job shop scheduling problems
• A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling
• Job shop scheduling with uncertainty based on genetic algorithm
• An effective hybrid optimization strategy for job-shop scheduling problems

This page was built for publication: Genetic Simulated-Annealing Algorithm for Robust Job Shop Scheduling

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