A CONNECTIONIST METHOD TO SOLVE JOB SHOP PROBLEMS

DOI10.1080/01969720050045994MaRDI QIDQ4786868zbMATH OpenOpenAlexFDO

Authors Marko Fabiunke, Gerd Kock

Publication date 14 April 2003

Published in Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01969720050045994

zbMATH Keywords

connectionist ideasjob shop problemsscheduling problems

Mathematics Subject Classification ID

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

Recommendations

• Dynamical Neural Network Approach to the Job-shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• A new adaptive neural network and heuristics hybrid approach for job-shop scheduling
• Job Shop Scheduling by Local Search
• scientific article; zbMATH DE number 4115948

Cited in

(2)

• Distributed project scheduling with information sharing in supply chains: part II—theoretical analysis and computational study
• A neural network algorithm for servicing jobs with sequential and parallel machines

This page was built for publication: A CONNECTIONIST METHOD TO SOLVE JOB SHOP PROBLEMS

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