


default search action
INFOR: Information Systems and Operational Research, Volume 54
Volume 54, Number 1, 2016
- Navin Chari, Uday Venkatadri
, Claver Diallo
:
Design of a reverse logistics network for recyclable collection in Nova Scotia using compaction trailers. 1-18 - Minyue Jin, Sheng Ang, Feng Yang, Gongbing Bi:
An improved cross-ranking method in data envelopment analysis. 19-32 - Line Blander Reinhardt, David Pisinger
, Simon Spoorendonk, Mikkel Sigurd:
Optimization of the drayage problem using exact methods. 33-51 - Saba Vahid, Nadia Lehoux, Luis Antonio de Santa-Eulalia, Sophie D'Amours
, Jean-Marc Frayret, Uday Venkatadri:
Supply chain modelling frameworks for forest products industry: a systematic literature review. 52-75
- David Pla-Santamaria, Fouad Ben Abdelaziz, Hatem Masri:
Call for Papers - Special Issue on Multidimensional perspectives in Finance and Investment. 76-77
Volume 54, Number 2, 2016
- Leandro C. Coelho
, Jacques Renaud
, Gilbert Laporte:
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015. 79-96 - Urooj Pasha, Arild Hoff, Lars Magnus Hvattum:
Simple heuristics for the multi-period fleet size and mix vehicle routing problem. 97-120 - Aysegül Altin-Kayhan
, Melek Sendil:
Optimal path selection under different data. 121-146 - Veaceslav Ghilas, Emrah Demir
, Tom Van Woensel
:
The pickup and delivery problem with time windows and scheduled lines. 147-167
Volume 54, Number 3, 2016
Editorial
- Gregory Paradis
:
Editorial note for the special issue on forestry applications. 169-170
- Chaker Alayet, Nadia Lehoux, Luc LeBel, M. Bouchard:
Centralized supply chain planning model for multiple forest companies. 171-191 - Nadia Lehoux, Luc LeBel, Momen Elleuch:
Benefits of inter-firm relationships: application to the case of a five sawmills and one paper mill supply chain. 192-209 - Rodrigo Cambiaghi Azevedo, Sophie D'Amours
, Mikael Rönnqvist
:
Advances in profit-driven order promising for make-to-stock environments - a case study with a Canadian softwood lumber manufacturer. 210-233 - Rezvan Rafiei, Mustapha Nourelfath
, Jonathan Gaudreault
, Luis Antonio de Santa-Eulalia, Mathieu Bouchard:
Analysis of uncontrollable supply effects on a co-production demand-driven wood remanufacturing mill with alternative processes. 234-261 - Juan J. Troncoso, Andrés Weintraub
, David L. Martell:
Development of a threat index to manage timber production on flammable forest landscapes subject to spatial harvest constraints. 262-281 - Gert Andersson, Patrik Flisberg, Maria Nordström, Mikael Rönnqvist
, Lars Wilhelmsson:
A model approach to include wood properties in log sorting and transportation planning. 282-303
Volume 54, Number 4, 2016
- Clifford Beaton, Claver Diallo
, Eldon A. Gunn:
Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints. 305-316 - João C. N. Clímaco, Marta M. B. Pascoal
:
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs. 317-343 - Minho Lee, Roy H. Kwon, Chi-Guhn Lee
:
Bounds for portfolio weights in decentralized asset allocation. 344-354 - Ajinkya N. Tanksale
, Jitendra Kumar Jha:
An effective heuristic for multi-period multi-foodgrain inventory transportation problem in India. 355-379

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.