An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-015-9974-7
Abstract: This paper considers the large-scale mixed job shop scheduling problem with general number of jobs on each route. The problem includes ordinary machines, batch machines (with bounded or unbounded capacity), parallel machines, and machines with… read more here.
Keywords: large scale; job shop; shop scheduling; scale mixed ... See more keywords