Journal: Computers & OR

Volume 37, Issue 12

2041 -- 2061Arild Hoff, Henrik Andersson, Marielle Christiansen, Geir Hasle, Arne Løkketangen. Industrial aspects and literature survey: Fleet composition and routing
2062 -- 2070Imma Ribas, Ramón Companys, Xavier Tort-Martorell. Comparing three-step heuristics for the permutation flow shop problem
2071 -- 2081Xiangyong Li, M. F. Baki, Yash P. Aneja. An ant colony optimization metaheuristic for machine-part cell formation problems
2082 -- 2088Anis Gharbi, Mohamed Labidi. Jackson s semi-preemptive scheduling on a single machine
2089 -- 2105Emmanouil E. Zachariadis, Chris T. Kiranoudis. A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem
2106 -- 2120Majid Salari, Paolo Toth, Andrea Tramontani. An ILP improvement procedure for the Open Vehicle Routing Problem
2121 -- 2130Rudolf Vetschera. A general branch-and-bound algorithm for fair division problems
2131 -- 2140Evelina Klerides, Eleni Hadjiconstantinou. A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations
2141 -- 2151Bernat Gacias, Christian Artigues, Pierre Lopez. Parallel machine scheduling with precedence constraints and setup times
2152 -- 2163Ayed A. Salman, Imtiaz Ahmad, Mahamed G. H. Omran, Mohammad Gh. Mohammad. Frequency assignment problem in satellite communications using differential evolution
2164 -- 2172Geraldo R. Mauri, Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lorena. A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem
2173 -- 2181Bacel Maddah, Muhammad El-Taha, Roy Abou Tayeh. Optimal allocation of servers and processing time in a load balancing system
2182 -- 2191Burcu Baris Keskin, Halit Üster, Sila Çetinkaya. Integration of strategic and tactical decisions for vendor selection under capacity constraints
2192 -- 2201Abir Ben Hmida, Mohamed Haouari, Marie-José Huguet, Pierre Lopez. Discrepancy search for the flexible job shop scheduling problem
2202 -- 2217Jonathan F. Bard, Narameth Nananukul. A branch-and-price algorithm for an integrated production and inventory routing problem
2218 -- 2228Dvir Shabtay, Yisrael Itskovich, Liron Yedidsion, Daniel Oron. Optimal due date assignment and resource allocation in a group technology scheduling environment
2229 -- 2238Yi-Kuei Lin, Cheng-Ta Yeh. Optimal resource assignment to maximize multistate network reliability for a computer network
2239 -- 2247Paula Sarabando, Luis C. Dias. Simple procedures of choice in multicriteria problems without precise information about the alternatives values
2248 -- 2256Zhirong Liang, Yanzhi Li, Andrew Lim, Songshan Guo. Load balancing in project assignment
2257 -- 2269Tsung-Che Chiang, Hsueh-Chien Cheng, Li-Chen Fu. A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
2270 -- 2280A. M. Benjamin, J. E. Beasley. Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities