Purpose: The goal of this article is to provide an extensive literature review of the models and solution procedures proposed by many researchers interested on the Project Scheduling Problem with non-deterministic activities duration. Design/methodology/approach: This paper presents an...

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the...

Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the...

This paper presents an algorithm to solve the multilevel location-allocation problem when sabotage risk is considered (MLLAP-SB). Sabotage risk is the risk that a deliberate act of sabotage will happen in a living area or during the transportation of a vehicle. This can change the way decisions...

We consider a novel generalization of the resource-constrained project scheduling problem (RCPSP). Unlike many established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we consider the important real-life aspect that capacity...

The advance in the global environment, rapidly changing markets, and information technology has created a new stage for design. In such an environment, one strategy for success is the Collaborative Product Development (CPD). Organizing people effectively is the goal of Collaborative Product...

We propose a framework for an ensemble bankruptcy classifier that uses if-then rules to combine the outputs from a heterogeneous set classifiers. A genetic algorithm (GA) induces the rules using an asymmetric, cost-sensitive fitness function that includes accuracy and misclassification costs....

This article describes how the 0/1 Multiple Knapsack Problem (MKP), a generalization of popular 0/1 Knapsack Problem, is NP-hard and harder than simple Knapsack Problem. Solution of MKP involves two levels of choice – one for selecting an item to be placed and the other for selecting the...