Non-permutation flow shop scheduling problem with preemption-dependent processing time

Mohsen Ziaee,Hossein Karimi,Yibing Li

doi:10.1080/23311916.2016.1243982

Abstract

AbstractIn this paper, the non-permutation flow shop scheduling problem with preemption-dependent processing times is considered. A mixed integer programming formulation is proposed to tackle the problem. The optimization objective considered is the minimization of the total tardiness. The model is tested against random instances. The results allow us to identify the effect of some parameters such as coefficient of preemption-dependent processing time, number of preemptions and the selected machine for preemption on the total tardiness.

Highlights

In order to employ full capacity of machines, it is essential to adjust the load so that it is evenly spread between them
The processing time of a job is considered as fixed in the classical scheduling problems with preemption; while in numerous real situations, due to the required time to prepare a machine or to be ready to process a job or preemptive job, the processing time of a job may be increased
Suppose that each job has some operations, each operation needs a different machine, all jobs are processed in the same machine sequence, and the job sequence of each machine has to be identified to optimize an objective. This problem is known as the flow shop scheduling problem

Summary

Introduction

In order to employ full capacity of machines, it is essential to adjust the load so that it is evenly spread between them. Hossein Karimi was born in 1987 in Kordkouy, which is a city in the north of Iran He is assistant professor in Industrial Engineering at University of Bojnord. A preemption-dependent processing time is suggested for the non-permutation flow shop scheduling problem. A new assumption called preemption-dependent processing times is considered. Suppose that each job has some operations, each operation needs a different machine, all jobs are processed in the same machine sequence, and the job sequence of each machine has to be identified to optimize an objective This problem is known as the flow shop scheduling problem. As stated before, this paper suggests a new concept of preemption-dependent processing times. Considering this assumption leads us to more realistic problems.

Related works

Findings

Conclusions