Job-shop scheduling problem incorporating assembly constraint and its solution using genetic decoding approach

MaRDI QIDQ3170798zbMATH OpenFDO

Authors Linping Wang, Zhenyuan Jia, Fuji Wang, Fanbin Meng

Publication date 29 September 2011

zbMATH Keywords

genetic algorithmdecodingfabricationjob-shop scheduling problemassembly constraint

Mathematics Subject Classification ID

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

Cited in

(1)

• Development and comparison of multiple genetic algorithms and heuristics for assembly production planning

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)