In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP....

In this paper, a bi-level game-theoretic model is proposed to investigate the effects of governmental financial intervention on green supply chain. This problem is formulated as a bi-level program for a green supply chain that produces various products with different environmental pollution...

This paper presents a Genetic Algorithms (GAs) for integration of various types of Distributed Generations (DGs), Static Synchronous Compensator (STATCOM) and Plug-in-Hybrid Electric Vehicle (PHEVs) with different static load models (DSLMs) such as LM-1, LM-2, LM-3, LM-4 and LM-5, respectively...

Behavioral and experimental literature on financial instability focuses on either subjective price expectations (Learning-to-Forecast experiments) or individual trading (Learning-to-Optimize experiments). Bao et al. (2017) have shown that subjects have problems with both tasks. In this paper, I...

Purpose: The overstocked goods flow in the hub of hub-and-spoke logistics network should be disposed of in time, to reduce delay loss and improve the utilization rate of logistics network resources. The problem we need to solve is to let logistics network cooperate by sharing network resources...

This article proposes a methodology to resolve the advertising method selection problem (AdSP). The use of different advertising methods for the same product can generate different responses in terms of the product’s sales volume. Companies selling products have limited resources for...

This research developed a solution approach that is a combination of a web application and the modified differential evolution (MDE) algorithm, aimed at solving a real-time transportation problem. A case study involving an inbound transportation problem in a company that has to plan the direct...

In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We...