default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2016
- Hasan Murat Afsar, Christian Artigues, Eric Bourreau
, Safia Kedad-Sidhoum:
Machine reassignment problem: the ROADEF/EURO challenge 2012. Ann. Oper. Res. 242(1): 1-17 (2016) - Felix Brandt, Jochen Speck, Markus Völker:
Constraint-based large neighborhood search for machine reassignment - A solution approach to the ROADEF/EURO challenge 2012. Ann. Oper. Res. 242(1): 63-91 (2016) - 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. Ann. Oper. Res. 242(1): 133-160 (2016) - T. C. E. Cheng
, Bo Peng, Zhipeng Lü:
A hybrid evolutionary algorithm to solve the job shop scheduling problem. Ann. Oper. Res. 242(2): 223-237 (2016) - 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. Ann. Oper. Res. 242(2): 457-487 (2016) - Ali Diabat
, Tarek Abdallah
, Tung Le:
A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods. Ann. Oper. Res. 242(2): 373-398 (2016) - 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. Ann. Oper. Res. 242(2): 285-301 (2016) - Mohammad Fattahi
, Masoud Mahootchi, S. M. Moattar Husseini:
Integrated strategic and tactical supply chain planning with price-sensitive demands. Ann. Oper. Res. 242(2): 423-456 (2016) - Michaël Gabay
, Sofia Zaourar:
Vector bin packing with heterogeneous bins: application to the machine reassignment problem. Ann. Oper. Res. 242(1): 161-194 (2016) - Haris Gavranovic, Mirsad Buljubasic:
An efficient local search with noising strategy for Google Machine Reassignment problem. Ann. Oper. Res. 242(1): 19-31 (2016) - Kannan Govindan
:
Evolutionary algorithms for supply chain management. Ann. Oper. Res. 242(2): 195-206 (2016) - Jörn Grahl, Stefan Minner
, Daniel Dittmar:
Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times. Ann. Oper. Res. 242(2): 489-504 (2016) - Wojciech Jaskowski
, Marcin Grzegorz Szubert, Piotr Gawron:
A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem. Ann. Oper. Res. 242(1): 33-62 (2016) - Can Berk Kalayci
, Olcay Polat
, Surendra M. Gupta:
A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem. Ann. Oper. Res. 242(2): 321-354 (2016) - Yongjian Li, Xiaoqiang Cai, Lei Xu
, Wenxia Yang:
Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints. Ann. Oper. Res. 242(2): 265-283 (2016) - Xiang Li, Guohua Sun, Yongjian Li:
A multi-period ordering and clearance pricing model considering the competition between new and out-of-season products. Ann. Oper. Res. 242(2): 207-221 (2016) - Kris Lieckens, Nico Vandaele:
Differential evolution to solve the lot size problem in stochastic supply chain management systems. Ann. Oper. Res. 242(2): 239-263 (2016) - Mehdi Mrad
, Anis Gharbi, Mohamed Haouari
, Mohamed Kharbeche
:
An optimization-based heuristic for the machine reassignment problem. Ann. Oper. Res. 242(1): 115-132 (2016) - An Pan, Tsan-Ming Choi
:
An agent-based negotiation model on price and delivery date in a fashion supply chain. Ann. Oper. Res. 242(2): 529-557 (2016) - Gabriel M. Portal, Marcus Ritt
, Leonardo Borba, Luciana S. Buriol:
Simulated annealing for the machine reassignment problem. Ann. Oper. Res. 242(1): 93-114 (2016) - Hamed Soleimani, Mirmehdi Seyyed-Esfahani, Mohsen Akbarpour Shirazi:
A new multi-criteria scenario-based solution approach for stochastic forward/reverse supply chain network design. Ann. Oper. Res. 242(2): 399-421 (2016) - Dhananjay R. Thiruvady
, Andreas T. Ernst
, Gaurav Singh
:
Parallel ant colony optimization for resource constrained job scheduling. Ann. Oper. Res. 242(2): 355-372 (2016) - Jie Wei, Jing Zhao:
Pricing decisions for substitutable products with horizontal and vertical competition in fuzzy environments. Ann. Oper. Res. 242(2): 505-528 (2016) - 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. Ann. Oper. Res. 242(2): 303-320 (2016)
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-08-20 09:43 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint