• No results found

dynamic job-shop scheduling problem

Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm

Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm

... mentioned job in the shop. The job’s entrance times to the shop for the jobs less than 30, the uniform dispatching are used and for the jobs equal or greater than 30, the uniform dispatching are used ...

12

Job-Shop Scheduling Problem With Sequence Dependent Setup Times

Job-Shop Scheduling Problem With Sequence Dependent Setup Times

... scheduling problem (DJSSP) could be considered as a queuing system that consists of machines and jobs where each job requires a specified sequence (routing) on the machines and involves certain ...

7

Implementing Digital Twins of Smart Factories with Interval Algebra

Implementing Digital Twins of Smart Factories with Interval Algebra

... the Job-shop Schedul- ing Problem (JSP) is arguably one of the most widely studied optimisation problems ...the problem sizes found in industry ...the problem, exact solutions are not ...

9

Dynamic scheduling in a multi-product manufacturing system

Dynamic scheduling in a multi-product manufacturing system

... proper scheduling system. This is important to enable job orders to be completed on time, minimize waiting time and maximize utilization of equipment and ...a scheduling system that is able to react ...

161

AN ENHANCED RULE APPROACH FOR NETWORK INTRUSION DETECTION USING EFFICIENT DATA 
ADAPTED DECISION TREE ALGORITHM

AN ENHANCED RULE APPROACH FOR NETWORK INTRUSION DETECTION USING EFFICIENT DATA ADAPTED DECISION TREE ALGORITHM

... solving job-shop scheduling problem, though standard PSO has some effect, it still has defects of low convergence speed, and trapping into local ...the dynamic nonlinear ω, the position ...

5

A Particle Swarm Optimization to Minimize Makespan for a Four Stage Multiprocessor Open Shop with Dynamic Job Release Time

A Particle Swarm Optimization to Minimize Makespan for a Four Stage Multiprocessor Open Shop with Dynamic Job Release Time

... machine scheduling problem in LED manufacturing can be treated as a type of multiprocessor open shop scheduling problem with job release time and the objective to improve ...

6

Towards implementing reactive scheduling for job shop problem

Towards implementing reactive scheduling for job shop problem

... on scheduling has been focused mainly on optimizing one particular performance measure, like the use of resources, makespan or tardiness, normally reflecting some kind of ...all problem data are known ...

6

INCORPORATION OF NEGOTIATION PROCESS INTO AN E COMMERCE PLATFORM TO INCREASE SALES

INCORPORATION OF NEGOTIATION PROCESS INTO AN E COMMERCE PLATFORM TO INCREASE SALES

... study job shop scheduling problems with transportation constraints (TJSSP) in various ...of problem is difficult to solve even for simplified and small size ...Systems Scheduling ...

11

A New Combined Approach for Optimizing Makespan in Job Shop Scheduling Problem

A New Combined Approach for Optimizing Makespan in Job Shop Scheduling Problem

... In fact, only small-size instances of the problems can be solved within a reasonable computational time by exact optimization algorithms such as branch and bound [1], [2] and dynamic programming [3], [4], ...

11

An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem

An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem

... to job shop scheduling ...and dynamic programming. The job shop scheduling problem (JSP) has a finite set of jobs processed on a finite set of ...Each job is ...

26

Critical Path Method for Flexible Job Shop Scheduling Problem with Preemption

Critical Path Method for Flexible Job Shop Scheduling Problem with Preemption

... FJSP problem was based on this assumption that an operation should be done by the same machine after allocation of any operation to one machine while such an assumption may lead to idleness of some machines within ...

9

Agent Based Markov Chain For Job Shop Scheduling And Control: Review Of The Modeling  Technigue

Agent Based Markov Chain For Job Shop Scheduling And Control: Review Of The Modeling Technigue

... the job shop problem based on the decomposition of mathematical programming problems that used both Benders-type [10] and Dantzig/wolfe-type [11] ...hierarchical shop floor control ...each ...

16

A Modified Giffler and Thompson Genetic Algorithm on the Job
Shop Scheduling Problem

A Modified Giffler and Thompson Genetic Algorithm on the Job Shop Scheduling Problem

... The Giffler and Thompson approach to GA for crossover as described by Yamada [5] is outlined in the following algorithm. The crossover provides a method whereby information for differing solutions can be melded to allow ...

17

Representations in Genetic Algorithm for the Job Shop Scheduling Problem: A Computational Study

Representations in Genetic Algorithm for the Job Shop Scheduling Problem: A Computational Study

... each run. It is found that the main problem parameter that directly affects the computational time in a given problem is the number of operations. This is mainly attri- buted to the decoding mechanism of ...

8

A hybrid algorithm for flexible job-shop scheduling problem with setup times

A hybrid algorithm for flexible job-shop scheduling problem with setup times

... FJSP is classified as Total FJSP and Partial FJSP (Kacem et al., 2002). In Total FJSP (T-FJSP), each operation can be processes by all machines. However, in Partial FJSP (P-FJSP), at least one operation may not be ...

8

A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem

A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem

... flexible job shop scheduling problem (FJSP) is considered as an important problem in the modern manufacturing ...NP-hard problem. Most of the algorithms used in solving FJSP ...

11

Optimization of Thrust Force and Material Removal Rate in Turning EN-16 Steel Alloy using Taguchi Approach

Optimization of Thrust Force and Material Removal Rate in Turning EN-16 Steel Alloy using Taguchi Approach

... for job-shop scheduling problem. The present job shop configuration is defined as: there is a combination of ‘n’ numbers of jobs given as: J = {J1, J2, ...every job ...

9

A Scatter Search Method for Fuzzy Job Shop Scheduling Problem with Availability Constraints

A Scatter Search Method for Fuzzy Job Shop Scheduling Problem with Availability Constraints

... Genetic Algorithm (GA) was invented by John Holland [30]. GA uses a collection of solutions called population. Each individual in the population is called a chromosome. A chromosome is representing a solution to the ...

5

JOB SHOP RE- SCHEDULING USING GENETIC ALGORITHM – A CASE STUDY

JOB SHOP RE- SCHEDULING USING GENETIC ALGORITHM – A CASE STUDY

... The source codes for all the above algorithms are developed using the computer language ‘C’ and the tests are run on a PC with a Pentium –III processor. All the source codes are generalized in such a way that they can ...

5

Model Analysis on Job Shop Scheduling in Automobile Industry using Ant Colony Optimization and Particle Swarm Optimization

Model Analysis on Job Shop Scheduling in Automobile Industry using Ant Colony Optimization and Particle Swarm Optimization

... the Job Shop Scheduling Problem using Ant Colony Optimization, the process is similar to that of finding the distance between two nodes in a weighted tree ...no job has been scheduled ...

5

Show all 10000 documents...

Related subjects