Abstract
Abstract Many researchers solve scheduling problems with sequence dependent set-up times using a travelling salesman problem formulation. We show that this reduction may produce poor solutions when applied to the cyclic lot scheduling problem. We propose one approach that may remedy the situation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
