hazards in different areas have different effects and consequences. nowadays considering industries vital conditions, it seems necessary to boost organizations confronting uncertainties and risks. one solution for reducing these risks, is increasing agility, stability and flexibility in production process. this study tries to increase organization capabilities in supply chain hazards handing, u...

In this paper we describe a simplified way to implement performance control in a multi-tier computing system designed for e-commerce applications. We show that the simpler SISO (Single Input Single Output) controller, rather than a more complex distributed or centralized MIMO (Multiple Input Multiple Output) controller, works well, regardless of the presence of multiple cluster nodes and multip...

this paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. for solving this multi-objective model, we develop a fuzzy multi-objective linear programming (fmolp) model. in this problem, a proposed fmolp method is applied with respect to the o...

appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. one type of scheduling problems is just-in-time (jit) scheduling and in this area, motivated by jit manufacturing, this study investigates a mathematical model for...

Task scheduling is an essential aspect of parallel processing system. This problem assumes fully connected processors and ignores contention on the communication links. However, as arbitrary processor network (APN), communication contention has a strong influence on the execution time of a parallel application. In this paper, we propose multi-objective genetic algorithm to solve task scheduling...

this paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. this paper presen...

In many manufacturing systems, jobs that are completed early are held as finished-goods inventory until their due-dates, and hence we incur earliness costs. Similarly, jobs that are completed after their due-dates incur penalty. The objective in such situations would, therefore, be to meet the due-dates of the respective jobs as closely as possible, and consequently minimize the sum of earlines...

in this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the p-mmrcpsp while due dates are included i...

The multi-processor total tardiness problem (MPTTP) is an -hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a number of processors. Exact algorithms like branch and bound have proven to be impractical for the MPTTP, leaving stochastic local search (SLS) algorithms as the main alternative to find high-quality schedules. Among the avai...

We present a multi-agent variant of the Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times. Since, i.a., agents have an incentive to lie, central planning is not feasible and decentralized methods such as automated negotiations are needed. Hereto, we propose and evaluate an iterative quota-based negotiation protocol.