One of the basic and significant problems, that a shop or a factory manager is encountered, is a suitable scheduling and sequencing of jobs on machines. One type of scheduling problem is job shop scheduling. There are different machines in a shop of which a job may require some or all these machines in some specific sequence. For solving this problem, the objective may be to minimize the makesp...

ABSTRACT: Parallel Assembly Lines with multi-line stations (PALBs) have been widely studied in recent years because PALBs can help improve the efficiency of a production system. However, need buffers has not considered PALBP literature. In this study, for first time literature, it is shown and demonstrated to consider use type line when their cycle times are different. Moreover, buffer sizing p...

Abstract In this paper, we propose a new linear programming-based approach that enables the consideration of technical car sequencing rules in master production scheduling mixed-model assembly lines at much higher level detail than previous approaches. To end, investigate certain interdependencies rules, which have largely been neglected, both practice and research literature. We illustrate exi...

Flexible job shop scheduling problem, is an extension of the classical job shop scheduling problem. In Flexible job shop scheduling problem, there are more than one machine with the same features for the same purpose. The problem can be defined as appointing the jobs to the machines (assignment) and ordering the jobs at each machine (sequencing) to serve the desired purpose. Multi-objective fle...

An optimization model for a scheduling problem for closely spaced parallel approaches has been formulated. It takes temporal, pairing, sequencing, separation route and grouping constraints into account. Simulations investigated possible advantages of advanced scheduling methods over first-come-firstserved scheduling. Also, this study evaluated the performance differences between the computation...

preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...

Warehouses scheduling is the problem of sequencing requests of products to fulfill several customers’ orders so as to minimize the average time and shipping costs. In this paper, a solution to the problem of multiple warehouses scheduling using the steady state genetic algorithm is presented. A mathematical model that organizes the relationships between customers and warehouses is also presente...

Scheduling concerns the allocation of limited resources overtime to perform tasks fulfill certain criterion and optimize one or several objective functions. One most popular models in scheduling theory is that flow-shop scheduling. During last 40 years, permutation sequencing problem with makespan minimization has held attraction many researchers. This characterized as Fm/prmu/Cmax notation Gra...

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

Recently, the commercial aviation community has experienced a significant increase in demand for air transportation. Despite the advent of new Air Traffic Control (ATC) technologies, this demand increase has not yet been followed by a matching increase in capacity. The capacity / demand mismatch affects ATC airspace and ground operations and results in significant delays during departure operat...