This paper presents an approach for finding an optimal schedule of n-jobs and m-machines flowshop scheduling problem involving transportation time between jobs by using neural networks. An algorithm has been given for finding the optimal sequence in scheduling problem without transportation time [2]. Here, this algorithm is applied when transportation times are involved between machines to find...

The specific goal of this paper is to present an efficient heuristic for n-jobs, two machine open shop scheduling involving job block criteria and weights of jobs due to their relative importance, under the condition when probabilities are associate with processing time to obtain an optimal or near optimal sequence which minimize the makespan. The proposed heuristic developed in this paper is s...

In this paper we present an algorithm for planning in nondeterministic domains. Our algorithm C-SHOP extends the successful classical HTN planner SHOP, by introducing new mechanisms to handle situations where there is incomplete and uncertain information about the state of the environment. Being an HTN planner, C-SHOP supports coding domain-dependent knowledge in a powerful way that describes h...

This study aims to analyze the effect of Instagram promotion media on consumer satisfaction at Vanila Sweet dessert box shop. Consumer is level feelings after making a comparison between goods/services received and what expected. The independent variable in this dependent satisfaction. research was conducted shop, Sweet, which located Bogor City from March 2021 May 2022. method used survey with...

The Mixed No-Idle Flow-shop Scheduling Problem (MNIFSP) is an extension of flow-shop scheduling, which has practical significance and application prospects in production scheduling. To improve the efficacy solving complicated multiobjective MNIFSP, a MultiDirection Update (MDU) based Multiobjective Particle Swarm Optimization (MDU-MoPSO) proposed this study. For biobjective optimization problem...

We consider the ow-shop scheduling problem. The objective is to schedule the jobs on the machines so that we minimize the time by which all jobs are completed. We studied and implemented diierent versions of the algorithm of Sevast'yanov based on linear programming to solve this problem. Using CPLEX, we did computational tests with random instances having up to 1000 jobs and 100 machines. If th...

The flow shop scheduling problem consists in the assignment of a set of jobs J = {J1, . . . , Jn}, each of which consists of a set of operations Jj = {Oj1, . . . , Ojoj} onto a set of machines M = {M1, . . . ,Mm} [5, 18]. Each operation Ojk is processed by at most one machine at a time, involving a non-negative processing time pjk. The result of the problem resolution is a schedule x, defining ...

Flexible job-shop scheduling problem (FJSP) has been well known as one of the most difficult NP-hard combinatorial optimization problems. This problem FJSP is an extension of job-shop scheduling problem (JSP) which is to create a sequence of operations satisfying the precedence relationship together with assignment of time and resources for each operation. Thus, the FJSP model is closer to the ...