default search action
Annals of Operations Research, Volume 242
Volume 242, Number 1, July 2016
- Hasan Murat Afsar, Christian Artigues, Eric Bourreau, Safia Kedad-Sidhoum:
Machine reassignment problem: the ROADEF/EURO challenge 2012. 1-17 - Haris Gavranovic, Mirsad Buljubasic:
An efficient local search with noising strategy for Google Machine Reassignment problem. 19-31 - Wojciech Jaskowski, Marcin Grzegorz Szubert, Piotr Gawron:
A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem. 33-62 - Felix Brandt, Jochen Speck, Markus Völker:
Constraint-based large neighborhood search for machine reassignment - A solution approach to the ROADEF/EURO challenge 2012. 63-91 - Gabriel M. Portal, Marcus Ritt, Leonardo Borba, Luciana S. Buriol:
Simulated annealing for the machine reassignment problem. 93-114 - Mehdi Mrad, Anis Gharbi, Mohamed Haouari, Mohamed Kharbeche:
An optimization-based heuristic for the machine reassignment problem. 115-132 - Franck Butelle, Laurent Alfandari, Camille Coti, Lucian Finta, Lucas Létocart, Gérard Plateau, Frédéric Roupin, Antoine Rozenknop, Roberto Wolfler Calvo:
Fast machine reassignment. 133-160 - Michaël Gabay, Sofia Zaourar:
Vector bin packing with heterogeneous bins: application to the machine reassignment problem. 161-194
Volume 242, Number 2, July 2016
- Kannan Govindan:
Evolutionary algorithms for supply chain management. 195-206 - Xiang Li, Guohua Sun, Yongjian Li:
A multi-period ordering and clearance pricing model considering the competition between new and out-of-season products. 207-221 - T. C. E. Cheng, Bo Peng, Zhipeng Lü:
A hybrid evolutionary algorithm to solve the job shop scheduling problem. 223-237 - Kris Lieckens, Nico Vandaele:
Differential evolution to solve the lot size problem in stochastic supply chain management systems. 239-263 - Yongjian Li, Xiaoqiang Cai, Lei Xu, Wenxia Yang:
Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints. 265-283 - Ngoc Anh Dung Do, Izabela Ewa Nielsen, Gang Chen, Peter Nielsen:
A simulation-based genetic algorithm approach for reducing emissions from import container pick-up operation at container terminal. 285-301 - Baozhen Yao, Bin Yu, Ping Hu, Junjie Gao, Mingheng Zhang:
An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. 303-320 - Can Berk Kalayci, Olcay Polat, Surendra M. Gupta:
A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem. 321-354 - Dhananjay R. Thiruvady, Andreas T. Ernst, Gaurav Singh:
Parallel ant colony optimization for resource constrained job scheduling. 355-372 - Ali Diabat, Tarek Abdallah, Tung Le:
A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods. 373-398 - Hamed Soleimani, Mirmehdi Seyyed-Esfahani, Mohsen Akbarpour Shirazi:
A new multi-criteria scenario-based solution approach for stochastic forward/reverse supply chain network design. 399-421 - Mohammad Fattahi, Masoud Mahootchi, S. M. Moattar Husseini:
Integrated strategic and tactical supply chain planning with price-sensitive demands. 423-456 - Devika Kannan, Ahmad Jafarian, Akbar Hassanzadeh, Roohollah Khodaverdi:
Optimizing of bullwhip effect and net stock amplification in three-echelon supply chains using evolutionary multi-objective metaheuristics. 457-487 - Jörn Grahl, Stefan Minner, Daniel Dittmar:
Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times. 489-504 - Jie Wei, Jing Zhao:
Pricing decisions for substitutable products with horizontal and vertical competition in fuzzy environments. 505-528 - An Pan, Tsan-Ming Choi:
An agent-based negotiation model on price and delivery date in a fashion supply chain. 529-557
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.