This paper presents a predictive robust and stable approach for two-machine flow shop scheduling problem with machine disruption uncertain job processing time. Indeed, general is proposed that can be used robustness stability optimization in an m-machine or problem. The measure the total expected realized completion sum of squared aberration between each jobs’ time initial schedules measure. We...

There is a manufacturing system where several parts are processed through machining workstations and later assembled to form final products. In the event of disruptions such as machine failure, original flow-shop schedule needs be revised and/or rescheduled. scenario, rescheduling methods based on right-shift affected operations work very well. Here in this study, deviation make-span from used ...

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

In this paper, we make an improvement on McCahon and Lee’s algorithm for two-machine flow shop problem with uncertain processing time represented with fuzzy number. Especially, the scheme used in McCahon and Lee’s algorithm for ranking fuzzy processing times is modified to calculate better the minimum makespan. Example and extensive simulation results are presented to show the improved performa...

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

Scheduling problems naturally arise in supply chains, ranging from manufacturing and business levels in a single firm through multi-organizational processes. In these environments, jobs are served by various resources. As scheduling choices are often decentralized, an inferior system solution may occur. In this paper we investigate a decentralized job-shop system, where jobs are processed utili...

A flexible flow shop problem can be considered as a generalization of a pure flow shop problem in which the jobs have to go through the stages in the same order. We consider a flexible flow shop problem with unrelated machines and setup times, where the processing times depend on the chosen machine and setup times are sequence-dependent. While for classical problems the processing times for eac...

The distributed blocking flow shop scheduling problem (DBFSP) allows modeling the scheduling process in companies with more than one factory. It configures production systems as flow shop lines where the blocking constraint must be considered. To the best of our knowledge, this variant of the distributed permutation flow shop scheduling problem has not been studied. In this working paper, we sh...