Abstract
A class of hypergraphs, called \(B\)-tails, is introduced. It is shown that a certain hypergraph can be assigned to any job shop problem in such a way that minimal \(B\)-tails correspond to optimal schedules. An algorithm for searching for a minimal \(B\)-tail is described.
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
