Typically, general job shop scheduling problems assume that working times of machines are equal, for instance eight hours a day. However, in real factories, these working times are different because the machines may have different processing speeds, or they may require maintenance. That is, one machine may need to be operated only half day whereas other machines may have to be operated for the ...

When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the operations to be scheduled. The combination of this representation and the use of a constructive algorithm introduces a bias typically favouring good solutions. When ant colony optimisation is applied to these proble...

In this paper we consider n-jobs, m-machines permutation flow shop scheduling problems. Flow shop scheduling is one of the most important combinational optimization problems. The permutation flow shop scheduling problems are NP-Hard (Non deterministic Polynomial time Hard). Hence many heuristics and metaheuristics were addressed in the literature to solve these problems. In this paper a hybrid ...

This paper proposes a new and efficient hybrid heuristic scheme for solving job-shop scheduling problems (JSP). A new and efficient population initialization and local search concept, based on genetic algorithms, is introduced to search the solution space and to determine the global minimum solution to the JSP problem. Simulated results imply that the proposed novel JSP method (called the PLGA ...

Open Shop is a classical scheduling problem: given a set J of jobs and a setM of machines, find a minimum-makespan schedule to process each job Ji ∈ J on each machine Mq ∈ M for a given amount piq of time such that each machine processes only one job at a time and each job is processed by only one machine at a time. In Routing Open Shop, the jobs are located in the vertices of an edge-weighted ...

In this paper a new neuro-genetic architecture is presented that solves a profit oriented dynamic job shop problem. In the job shop order acceptance and scheduling problem new jobs arrive continuously and because of insufficient job shop capacity, a selection has to be made among the offered jobs. The goal is to find an order acceptance policy, which is supported by a scheduling policy, that ma...

Job Shop scheduling problem has significant importance in many researching fields such as production management and programming and also combined optimizing. Job Shop scheduling problem includes two sub-problems: machine assignment and sequence operation performing. In this paper combination of particle swarm optimization algorithm (PSO) and gravitational search algorithm (GSA) have been presen...

This paper presents the salient aspects of a simulation-based experimental study of scheduling rules for scheduling a dynamic job shop in which the setup times are sequence dependent. A discrete event simulation model of the job shop system is developed for the purpose of experimentation. Seven scheduling rules from the literature are incorporated in the simulation model. Five new setup-oriente...

The job shop scheduling problem (JSSP) has attracted much attention in the field of both information sciences and operations research. This paper considers the permutation Job shop scheduling problem with the objective of minimizing make span. Artificial Bee Colony algorithm (ABC) is one of the search heuristics used to solve global optimization problems in complex search spaces. It is observed...

This study aims to investigate characteristics of job-shop scheduling methods for micro-enterprise. Many scheduling methods have been proposed and evaluated. However, most of evaluations are not focused on application for micro-enterprise. In order to figure out an appropriate scheduling method for micro-enterprise, job-shop scheduling methods are evaluated from the view of applicability for mi...