World-class manufacturing paradigms emerge from specific types of manufacturing systems with which they remain associated until they are obsolete. Since its introduction the lean paradigm is almost exclusively implemented in repetitive manufacturing systems employing flow-shop layout configurations. Due to its inherent complexity and combinatorial nature, scheduling is one application domain wh...

Bio-Inspired computing is the subset of Nature-Inspired computing. Job Shop Scheduling Problem is categorized under popular scheduling problems. In this research work, Bacterial Foraging Optimization was hybridized with Ant Colony Optimization and a new technique Hybrid Bacterial Foraging Optimization for solving Job Shop Scheduling Problem was proposed. The optimal solutions obtained by propos...

We discuss the application of economic coordination mechanisms to scheduling problems in manufacturing and logistics. We use job shop scheduling as a sample problem domain. We study economically augmented job shop problems (EJSP) which comprise valuation information. We demonstrate how instances of EJSP can be mapped to combinatorial job shop auction problems (CJSAP). A discussion of the tracta...

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...

A learning stage of scheduling tends to produce knowledge about a benchmark of priority dispatching rules which allows a scheduler to improve the solution quality for a set of similar job-shop problems. Once trained on the sample job-shop problems (usually with small sizes), the adaptive algorithm solves a similar job-shop problem (with a moderate size or a large size) better than heuristics us...

The paper presents an enterprise application that integrates material requirement planning (MRP) with job shop simulator using distributed object technology. The application aims to realize an integrated system that has rapid response to changing requirements and capability to integrate heterogeneous manufacturing facilities. At first, the application accepts the customer’s order and performs m...

We use the Akers-Friedman geometric approach to solve the two jobs job-shop problem when there is an earliness cost on the first operation and a tardiness cost on the last operation of each job. We then generalize the problem by imposing earliness and tardiness costs on each operation and finally, we solve it using a dynamic programming algorithm. KeywordsEarliness-tardiness scheduling, Polyn...

Flexible job-shop scheduling problem (FJSSP) is an extension of the classical job-shop scheduling problem that allows an operation to be processed by any machine from a given set along different routes. It is very important in both fields of production management and combinatorial optimisation. This paper presents a new approach based on attribute oriented mining technique to solve the multi-ob...

This paper presents a new algorithm based on integrating Genetic Algorithms and Tabu Search methods to solve the Job Shop Scheduling problem. The idea of the proposed algorithm is derived from Genetic Algorithms. Most of the scheduling problems require either exponential time or space to generate an optimal answer. Job Shop scheduling (JSS) is the general scheduling problem and it is a NP-compl...

The job-shop scheduling problem has attracted many researchers’ attention in the past few decades, and many algorithms based on heuristic algorithms, genetic algorithms, and particle swarm optimization algorithms have been presented to solve it, respectively. Unfortunately, their results have not been satisfied at all yet. In this paper, a new hybrid swarm intelligence algorithm consists of par...