scholarly journals Minimization of Rental Cost for Specially Structured Scheduling Model with Setup Time and Transportation Time

2020 ◽  
Vol 9 (3) ◽  
pp. 2866-2869
Keyword(s):  
Flow Shop ◽  
Setup Time ◽  
Flow Shop Scheduling ◽  
Processing Unit ◽  
Optimal Sequence ◽  
Processing Times ◽  
Scheduling Model ◽  
Heuristic Technique ◽  
Important Means ◽  
State Of Affairs

In the paper under consideration we have developed a new heuristic technique, to get the optimal sequence in which the jobs are to be processed so as to minimize the utilization time for which the machines are required and hence optimize the total expenditure incurred in hiring the machines on rent in case of a two stage specially structured flow shop scheduling model under pre-defined rental policy in which the processing times and setup times are linked with their relative probabilities, together with time taken for transporting the jobs from one processing unit to the next unit. The study taken up is quite broader and relates to the state of affairs existing in industrial units. The method given in this paper is reasonably simple and easy to apply and also offer an important means for taking decision regarding achieving an optimal sequence of jobs. Algorithm given in this paper is also explained by means of a numerical example.

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.

scholarly journals Solving Constrained Flow-Shop Scheduling Problem through Multistage Fuzzy Binding Approach with Fuzzy Due Dates

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Hamiden Abd El-Wahed Khalifa ◽  
Sultan S. Alodhaibi ◽  
Pavan Kumar
Keyword(s):  
Fuzzy Numbers ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Due Dates ◽  
Optimal Sequence ◽  
Elapsed Time ◽  
Processing Times ◽  
Scheduling Model ◽  
Interval Approximation ◽  
Real World Problems

This paper deals with constrained multistage machines flow-shop (FS) scheduling model in which processing times, job weights, and break-down machine time are characterized by fuzzy numbers that are piecewise as well as quadratic in nature. Avoiding to convert the model into its crisp, the closed interval approximation for the piecewise quadratic fuzzy numbers is incorporated. The suggested method leads a noncrossing optimal sequence to the considered problem and minimizes the total elapsed time under fuzziness. The proposed approach helps the decision maker to search for applicable solution related to real-world problems and minimizes the total fuzzy elapsed time. A numerical example is provided for the illustration of the suggested methodology.

scholarly journals A two-stage flow shop scheduling with a critical machine and batch availability

2012 ◽  
Vol 37 (1) ◽  
pp. 39-56 ◽  
Author(s):  
Enrique Gerstl ◽  
Gur Mosheiov
Keyword(s):  
Flow Shop ◽  
Setup Time ◽  
Flow Shop Scheduling ◽  
Medium Size ◽  
Two Stage ◽  
Total Load ◽  
Time Dynamic ◽  
Second Stage ◽  
Processing Times ◽  
Critical Machine

AbstractWe study a two-stage flowshop, where each job is processed on the first (critical) machine, and then continues to one of two second-stage (dedicated) machines. We assume identical (but machine-dependent) job processing times. Jobs are processed on the critical machine in batches, and a setup time is required when starting a new batch. The setting assumes batch-availability, i.e., jobs become available for the second stage only when their entire batch is completed on the critical machine. We consider three objective functions: minimum makespan, minimum total load, and minimum weighted flow-time. Polynomial time dynamic programming algorithms are introduced, which are numerically shown to be able to solve problems of medium size in reasonable time. A heuristic for makespan minimization is presented and shown numerically to be both accurate and efficient.

Heuristic for Three Machines Flow Shop Scheduling Problem to Minimize the Weighted Mean Flow Time

2012 ◽  
Vol 548 ◽  
pp. 714-718
Author(s):  
Ibrahima Camara ◽  
Hong Zhou
Keyword(s):  
Flow Shop ◽  
Flow Time ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Mean Flow ◽  
Production Flow ◽  
Weighted Mean ◽  
Optimal Sequence ◽  
Shop Scheduling ◽  
Processing Times

In practical situations, machines might not be available during certain time of period due to deterministic or stochastic causes in many production systems. And, processing times are always not exact as they have been predicted. In this paper, we attempted to study the three machines flow shop scheduling problem in which probabilities are associated with processing times of jobs involving transportation time, machine breakdown interval and weights of jobs. A simple heuristic approach is proposed to find optimal or near optimal sequence minimizing the weighted mean production flow time. A numerical example has been provided to illustrate and clarify the proposed algorithm.

Research on a Main-Branch Hybrid Flow Shop Scheduling Problem in Production Manufacturing System

2012 ◽  
Vol 252 ◽  
pp. 354-359
Author(s):  
Xin Min Zhang ◽  
Meng Yue Zhang
Keyword(s):  
Manufacturing System ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problem ◽  
Quantum Genetic Algorithm ◽  
Shop Scheduling ◽  
Scheduling Model ◽  
Hybrid Flow Shop Scheduling ◽  
Two Stages

A main-branch hybrid Flow shop scheduling problem in production manufacturing system is studied. Under the premise of JIT, targeting of smallest cost, a Flow-Shop production line scheduling model is built in cycle time of buffer. Two stages Quantum Genetic Algorithm (QGA) is proposed. By the results of numerical example, the effective and advantageous of QGA was shown.

Sign in / Sign up

Export Citation Format

Share Document