scholarly journals Robust and Stable Flow Shop Scheduling Problem under Uncertain Processing Times and Machines’ Disruption

2021 ◽  
Vol 34 (4) ◽  
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Processing Times ◽  
Stable Flow

scholarly journals Minimization of Utilization Time for Specially Structured n × 3 Scheduling Model with Jobs in a String of Disjoint Job Blocks

2019 ◽  
Vol 8 (12) ◽  
pp. 3554-3558
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Numerical Illustration ◽  
Optimal Sequence ◽  
Shop Scheduling ◽  
Elapsed Time ◽  
Processing Times ◽  
Scheduling Model ◽  
Utilization Time

The present paper investigates n×3 specially structured flow shop scheduling model with processing of jobs on given machines in a string of disjoint job blocks and with probabilities associated to the processing times of jobs. The objective is to minimize utilization time of second and third machine and also minimize the total elapsed time for processing the jobs for n×3 specially structured flow shop scheduling problem. The algorithm developed in this paper is quite straightforward and easy to understand and also present an essential way out to the decision maker for attaining an optimal sequence of jobs. The algorithm developed in this paper is validated by a numerical illustration.

A MILP and Genetic Algorithm Approach for a Furniture Manufacturing Flow Shop Scheduling Problem

2019 ◽  
pp. 238-259
Author(s):  
Marcell S. Kalman ◽  
Omar G. Rojas ◽  
Elias Olivares-Benitez ◽  
Samuel Moisés Nucamendi-Guillén
Keyword(s):  
Genetic Algorithm ◽  
Flow Shop ◽  
Solution Time ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Algorithm Optimization ◽  
Shop Scheduling ◽  
Processing Times ◽  
Furniture Manufacturing ◽  
Genetic Algorithm Approach

A MILP and genetic algorithm optimization model for the sequencing of jobs in a medium-sized factory, dedicated to the manufacturing of home furniture, where different categories and types of articles are produced and whose routes and manufacturing processing times vary widely, are proposed. Different scenarios are considered for the objective function based on minimizing makespan and tardiness. The results of the optimization for an instance of 24 jobs on five machines, chosen as a representative instance of the order sizes that are handled by the company, show important reductions in the productive system's usage times, oscillating between 10% and 20% with respect to a random initial sequence in the production plan. Improvements were similar in both techniques, the main difference being the solution time of each one.

Flow shop scheduling problem with position-dependent processing times

2019 ◽  
Vol 111 ◽  
pp. 325-345
Author(s):  
Santiago Sánchez-Herrera ◽  
Jairo R. Montoya-Torres ◽  
Elyn L. Solano-Charris
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Processing Times
Sign in / Sign up

Export Citation Format

Share Document