Abstract
The routing open shop problem is a generalization of scheduling open shop problem and metric TSP. The jobs are located at nodes of some transportation network while the machines travel on the network to execute the jobs in the open shop environment. The machines are initially located at the same node (the depot) and have to return to the depot after completing all the jobs. The goal is to construct a feasible schedule minimizing the makespan. The problem is known to be NP-hard even for the trivial case with two machines on a link.
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
