Critical paths of non-permutation and permutation flow shop scheduling problems
نویسندگان
چکیده
منابع مشابه
MILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملTight Bounds for Permutation Flow Shop Scheduling
In flow shop scheduling there are m machines and n jobs, such that every job has to be processed on the machines in the fixed order 1, . . . , m. In the permutation flow shop problem, it is also required that each machine processes the set of all jobs in the same order. Formally, given n jobs along with their processing times on each machine, the goal is to compute a single permutation of the j...
متن کاملDominance properties for permutation flow shop problems
We are interested here in new sub cases for which permutation flow shop schedules are dominant while considering the classical flow shop scheduling problem and the makespan criterion. To obtain these sub cases, we introduce conditions on the lower and upper bounds of the processing times. These conditions can be quite realistic when the corresponding line is balanced.
متن کاملmilp formulation and genetic algorithm for non-permutation flow shop scheduling problem with availability constraints
in this paper, we consider a flow shop scheduling problem with availability constraints (fsspac) for the objective of minimizing the makespan. in such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. we proposed a mixed-integer linear programming (milp) model for this problem which can generate non-permutation schedules. furthermor...
متن کاملEconomic Lot Sizing and Scheduling in Distributed Permutation Flow Shops
This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2020
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2019.8.001