Job-shop scheduling problem incorporating assembly constraint and its solution using genetic decoding approach
From MaRDI portal
Publication:3170798
zbMATH Open1240.90161MaRDI QIDQ3170798FDOQ3170798
Fanbin Meng, Linping Wang, Fuji Wang, Zhenyuan Jia
Publication date: 29 September 2011
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Recommendations
- Development and comparison of multiple genetic algorithms and heuristics for assembly production planning 👍 👎
- A genetic algorithm based procedure for more realistic job shop scheduling problems 👍 👎
- Solving flexible job shop scheduling problem by genetic algorithm 👍 👎
- A genetic algorithm applied to a classic job-shop scheduling problem 👍 👎
- GA based static scheduling of multilevel assembly job shops 👍 👎
This page was built for publication: Job-shop scheduling problem incorporating assembly constraint and its solution using genetic decoding approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170798)
