This study considers scheduling in Hybrid flow shop environment with unrelated parallel machines for minimizing mean of job's tardiness and mean of job's completion times. This problem does not study in the literature, so far. Flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. After modeling the p...

The concept of flexible manufacturing is highly appealing in gaining a competitive edge in the market by quickly adapting to the changing customer needs. Scheduling jobs on flexible manufacturing systems (FMSs) is a challenging task of managing the available flexibility on the shop floor to react to the dynamics of the environment in real-time. In this paper, an agent-oriented scheduling framew...

Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...

This Paper is an attempt to study two stage open shop scheduling problem in which processing time of the jobs are given. The objective of the paper is to obtain an algorithm to minimize the rental cost of the machines in two stage open shop scheduling problem under specified rental policy. A numerical illustration is given to justify the proposed algorithm.

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

This work studies the performance of two Mixed Integer Linear Programming (MILP) models to solve scheduling problems in a flexible job shop environment with recirculation and assembly using a due-date-based objective function. The models convey different approaches both in the modelling of time (discrete and continuous approaches) as well as in the assignment of jobs to machines. The comparison...

This paper develops a novel genetic algorithm (GA) based methodology for optimal tuning of a reported fuzzy dispatching system for a fleet of automated guided vehicles in a flexible manufacturing environment. The reported dispatching rules are transformed into a continuously adaptive procedure to capitalize the on-line information available from a shop floor at all times. Simulation results obt...

This article may be used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan, sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...

This is a summary of the journal article (Malapert et al. 2012) published by Journal on Computing entitled “An Optimal Constraint Programming Approach to the Open-Shop Problem”. The article presents an optimal constraint programming approach for the Open-Shop scheduling problem, which integrates recent constraint propagation and branching techniques with new upper bound heuristics. Randomized r...

Many problems in industry are a form of open-shop scheduling problem (OSSP). We describe a hybrid approach to this problem which combines a Genetic Algorithm (GA) with simple heuristic schedule building rules. Excellent performance is found on some benchmark OSS problems, including improvements on previous best-known results. We describe how our approach can be simply amended to deal with the m...