SOLVING A MULTI-OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH TIMED PETRI NETS AND GENETIC ALGORITHM

DOI10.1142/S1793830910000607zbMath1191.90017OpenAlexW2114400506MaRDI QIDQ3575380

Taiping Lu, Hejiao Huang

Publication date: 27 July 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830910000607

zbMATH Keywords

job shop schedulingPetri netsgenetic algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Some new results on simulated annealing applied to the job shop scheduling problem
• Effective neighbourhood functions for the flexible job shop problem
• Job Shop Scheduling by Simulated Annealing

This page was built for publication: SOLVING A MULTI-OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH TIMED PETRI NETS AND GENETIC ALGORITHM