Abstract The paper deals with a sequencing and routing problem originated by real-world application context. consists in defining the best sequence of locations to visit within warehouse for storage and/or retrieval given set items during specified time horizon, where storage/retrieval location an item is given. Picking put-away are simultaneously addressed, also considering some specific requi...

This paper proposes a Genetic Algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). Resources are renewable and there is a unique way to perform the activities. This work employs Genetics Algorithms to schedule project activities to minimize makespan subject to precedence constraints and resources availability. A serial generation scheme is used to obtain the schedule. The ...

A Stochastic Partial profit–oriented Disassembly Line Balancing Problem (SP–DLBP) in the presence of hazardous parts is considered. The goal is to assign disassembly tasks of the best selected disassembly alternative to a sequence of workstations while respecting precedence and cycle time constraints. An AND/OR graph is used to model the disassembly alternatives and the precedence relations amo...

In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...

The resource constrained multi-mode multi-project scheduling problem (RCMMMPSP) is a notoriously difficult combinatorial optimization problem. For a given set of activities, feasible execution mode assignments and execution starting times must be found such that some optimization function, e. g. the makespan, is optimized. When determining an optimal (or at least feasible) assignment of decisio...

On the basis of uncertainty theory, plenty of researches have been done on uncertain resource-constrained project scheduling problems. Instead of minimizing the makespan, in this paper, we address the maximization of net present value of a project’s cash flows when activity durations are assumed to be uncertain. In addition to precedence constraint and resource constraint involved in resource-c...