Abstract
The contribution deals with local search based optimization of schedules that are modelled by Petri nets (PNs). PN modelling of scheduling problems in manufacturing domain is addressed and a generalization of neighbour solution generation is proposed. Such a solution generator can be used to optimize schedules by standard local search optimization algorithms. Neighbourhood construction procedures are described with the emphasis on solutions feasibility.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
