Jaydeep Balakrishnan, Chun Hung Cheng: Multi-period planning and uncertainty issues in cellular manufacturing: A review and future directions.
281-309
Ralph J. Olsson, Roger M. Hill: A two-echelon base-stock inventory model with Poisson demand and the sequential processing of orders at the upper echelon.
310-324
Sinan Gurel, M. Selim Akturk: Considering manufacturing cost and scheduling performance on a CNC turning machine.
325-343
Wan Lung Ng: A simple classifier for multiple criteria ABC analysis.
344-353
Ivan Kojadinovic: Minimum variance capacity identification.
498-514
D. F. Jones, A. Collins, C. Hand: A classification model based on goal programming with non-standard preference functions with application to the prediction of cinema-going behaviour.
515-524
Computing, Artificial Intelligence and Information Management
K. Spiliopoulos, S. Sofianopoulou: Calculating distances for dissimilar strings: The shortest path formulation revisited.
525-539
M. Belém Martins, Carlos Marques: Methodological aspects of a mathematical programming model to evaluate soil tillage technologies in a risky environment.
556-571
Wan-Kai Pang, Shui-Hung Hou, Wing-Tong Yu: On a proper way to select population failure distribution and a stochastic optimization method in parameter estimation.
604-611
Short Communications
Gur Mosheiov, Daniel Oron: Minmax scheduling with job-classes and earliness-tardiness costs.
612-622
Wlodzimierz Szwarc: Some remarks on the decomposition properties of the single machine total tardiness problem.
623-625
R. R. K. Sharma, V. Berry: Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort.
803-812
Gino K. Yang: Note on sensitivity analysis of inventory model with partial backorders.
865-871
Chi Chiang: Optimal ordering policies for periodic-review systems with a refined intra-cycle time scale.
872-881
K. Maity, Manoranjan Maiti: Possibility and necessity constraints and their defuzzification - A multi-item production-inventory scenario via optimal control theory.
882-896
Jung-Fa Tsai: An optimization approach for supply chain management models with quantity discount policy.
982-994
Ethem Çanakoglu, Taner Bilgiç: Analysis of a two-stage telecommunication supply chain with technology dependent demand.
995-1012
Sheng-Lin Chang, Reay-Chen Wang, Shih-Yuan Wang: Applying a direct multi-granularity linguistic and strategy-oriented aggregation approach on the assessment of supply performance.
1013-1025
Hisashi Kurata, John J. Liu: Optimal promotion planning - depth and frequency - for a two-stage supply chain under Markov switching demand.
1026-1043
Juite Wang, Yun-Feng Shu: A possibilistic decision model for new product supply chain design.
1044-1061
Stochastics and Statistics
Jianwei Chen, Kim-Hung Li, Yeh Lam: Bayesian single and double variable sampling plans for the Weibull distribution with censoring.
1062-1073
Hui-Ming Wee, Chun-Jen Chung: A note on the economic lot size of the integrated vendor-buyer inventory system derived without derivatives.
1289-1293
Shih-Wei Lin, Shuo-Yan Chou, Kuo-Ching Ying: A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date.
1294-1301
L. F. Lu, J. J. Yuan: The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard.
1302-1309
Markus Hirschberger, Yue Qi, Ralph E. Steuer: Randomly generating portfolio-selection covariance matrices with specified distributional characteristics.
1610-1625
Maciej Nowak: Aspiration level approach in stochastic MCDM problems.
1626-1640
Raf Jans, Zeger Degraeve: Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches.
1855-1875
P. Y. Mok, C. K. Kwong, Wai Keung Wong: Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory.
1876-1893
A. El-Bouri, Nader Azizi, Saeed Zolfaghari: A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling.
1894-1910
Athanassios Nikolakopoulos, Haralambos Sarimveis: A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem.
1911-1929
Prasanna Lokuge, Damminda Alahakoon: Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents.
1985-2015
Joaquín Bautista, Jordi Pereira: Ant algorithms for a time and space constrained assembly line balancing problem.
2016-2032
Rubén Ruiz, Thomas Stützle: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem.
2033-2049
data released under the ODC-BY 1.0 license
