Abstract This paper addresses the problem of scheduling chain-like structures tasks on a single multiprocessor resource. In fact, sub-tasks unit-time length and predefined size are aggregated to composite that have be scheduled without preemption, but subject flexibility concerning resource allocation. setting most closely resembles malleable task scheduling, with being smallest atomic unit The...

This paper delves into the scheduling of two-machine flow-shop problem with step-learning, a scenario in which job processing times decrease if they commence after their learning dates. The objective is to optimize resource allocation and task sequencing ensure efficient time utilization timely completion all jobs, also known as makespan. identified established NP-hard due its reduction single ...

This article presents an exact cooperative method for the solution of the Multidimensional Knapsack Problem (MKP ) which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the literature. Sol...

Abstract: This article presents an exact cooperative method for the solution of the multidimensional knapsack problem ( ) MKP which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the lite...

this paper presents a fuzzy decision-making approach to deal with a clustering supplier problem in a supply chain system. during recent years, determining suitable suppliers in the supply chain has become a key strategic consideration. however, the nature of these decisions is usually complex and unstructured. in general, many quantitative and qualitative factors, such as quality, price, and fl...

In this paper we study a particular version of the stochastic knapsack problem with normally distributed weights: the two-stage stochastic knapsack problem. In contrary to the single-stage knapsack problem, items can be added to or removed from the knapsack at the moment the actual weights come to be known (second stage). In addition, a probability constraint is introduced in the first stage in...

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

Through the use of application-specific branch-and-bound directives it is possible to find solutions to combinatorial models that would otherwise be difficult or impossible to find by just using generic branch-and-bound techniques within the framework of mathematical programing. Minto is an example of a system which offers the possibility to incorporate userprovided directives (written in C) to...

Fuzzy linear symmetrical bi-level programming is the most extensive problem in multi-level programming. A new method based on tolerance degree has been introduced in this paper. The method mainly concerns the modeling of complicated Supply Chain with bi-level Stackelberg structure. We analyze the reason lead to uncertainties in supply chain, summarize methods of dealing with uncertainties, and ...

Health service management plays a crucial role in human life. Blood related operations are considered as one of the important components of the health services. This paper presents a bi-objective mixed integer linear programming model for dynamic location-allocation of blood facilities that integrates strategic and tactical decisions. Due to the epistemic uncertain nature of ...