In this paper, a new mathematical model for the problem of job scheduling in virtual manufacturing cells (VMC) is presented to minimizing the completion time of all jobs. Sequence dependent setup times of machines is considered and lot-streaming is possible. In Virtual manufacturing cells, each job has a different processing path and there is a set of machines for processing each operation. The...

A frequently occurring operational problem is one of processing a given number of jobs (commodities) on a specified number of machines (facilities) referred to by various investigators as scheduling, dispatching, sequencing, or combinations thereof (Gupta and Stafford, 2006). In most manufacturing environments, a set of processes is needed to be serially performed in several stages before a job...

The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing a job, the machine has to be adjusted; there is onl...

Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

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

A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flo...

In the present scenario the recent engineering and industrial built-up units are facing hodgepodge of problems in a lot of aspects such as machining time, electricity, man power, raw material and customer’s constraints. The job-shop scheduling is one of the most significant industrial behaviours, particularly in manufacturing planning. This paper proposes the permutation flow shop sequencing pr...

This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...

Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...