A two level branch and bound algorithm is developed to solve an altered form of the standard flow-shop scheduling problem modeled as a bilevel programming problem. The flow-shop scheduling problem considered here differs from the standard problem in that operators are assigned to the machines and each operator has a different time table for the jobs on each machine. The shop owner is considered...

This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...

During last decades, developing multi-objective evolutionary algorithms for optimization problems has found considerable attention. Flexible job shop scheduling problem, as an important scheduling optimization problem, has found this attention too. However, most of the multi-objective algorithms that are developed for this problem use nonprofessional approaches. In another words, most of them c...

Flexible manufacturing system (FMS) scheduling is one of the most trusted and complicated task in machine scheduling. It is strongly Non polynomial complete combinatorial problem. FMS is agile and flexible which is well suited for simultaneous production of a wide variety of product mix in low volumes. Meta-heuristic approaches such as genetic algorithm, simulated annealing etc. are widely appl...

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

Abstract Different with the plain flexible job-shop scheduling problem (FJSP), FJSP routing flexibility is more complex and it can be deemed as integrated process planning (job shop) (IPPS) problem, where job shop two important functions are considered a whole optimized simultaneously to utilize in manufacturing system. Although, many novel meta-heuristics have been introduced address this corr...

Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, it quit difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. The combining of several optimization criteria induces additional complexity and new problems. In this paper, a...