| Document Date: 2012-12-18 10:57:27
Open Document File Size: 245,86 KBShare Result on Facebook
City Cambridge / / Company IBM / MIT Press / Red Hat / AMD / C.A. Valle L.C. / John Wiley & Sons / / Country Canada / / Currency AMD / / / Facility University of Qatar / University of Toronto / / IndustryTerm sub-optimal master solution / guarantees on solution / branchand-bound algorithm / tabu search algorithm / local search / branch-and-cut algorithm / branch-and-bound algorithm / local search methods / branch-andbound algorithm / genetic algorithm / ant colony optimization algorithm / recent master problem solution / quality solutions / chemical plant / hybrid algorithm / tabu search / tabu search heuristic / chemical / benders decomposition algorithms / specified scheduling algorithm / infeasible solution / heuristic solutions / using local search / / OperatingSystem Red Hat Enterprise Linux / / Organization National Institute of Health / MIT / University of Qatar / Operational Research Society / University of Toronto / / Person Ghaith Rabadi / Tony T. Tran / J. Christopher Beck / / Position Prime Minister / salesman / / Product Linux / / ProgrammingLanguage TSP / / ProvinceOrState Massachusetts / / Technology specified scheduling algorithm / Linux / genetic algorithm / branchand-bound algorithm / html / updated ACO algorithm / branch-and-bound algorithm / hybrid algorithm / load balancing / artificial intelligence / two-stage ant colony optimization algorithm / benders decomposition algorithms / partitioning algorithm / branch-and-cut algorithm / tabu search algorithm / two-phase algorithm / branch-andbound algorithm / / URL http /
SocialTag |
Logic-based Benders Decomposition for Alternative Resource Scheduling with Sequence Dependent Setups Tony T. Tran and J. Christopher Beck1 Abstract. We study an unrelated parallel machines scheduling problem with sequenc