We study an inverse counterpart of the two machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for which the value of the makespan is minimum, in the inverse scheduling the exact values of processing times are unknown and they should be selected with...

Multiprocessor task scheduling is a generalized form of classical machine scheduling where a task is processed by more than one processor. It is a challenging problem encountered in wide range of applications and it is vastly studied in the scheduling literature (see for instance (Chan & Lee, 1999 and Drozdowski, 1996) for a comprehensive introduction on this topic). However, Drozdowski (1996) ...

different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...

The reentrant hybrid flow shop for a heat treatment process is considered in this study. We consider job scheduling in a reentrant hybrid flow shop problem that consists of two statges in series. The first stage is washing, followed by heat treating in the second stage. Each job passes through the first and second stages, respectively, and then re-enter the first stage one more time. Since the ...

This paper presents an investigation of scheduling procedures to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a static flexible flow shop scheduling environment. The flexible flow shop problem is a scheduling of jobs in a flow shop environment consisting of series of production stages, some of which may have only one machine, but at least one ...

This paper presents a model for a dock assignment problem, where trailers need to be assigned to gates for a given period of time for loading or unloading activities. The parking lot is used as a buffer zone. Transportation between the parking lot and the gates is performed by additional resources called terminal tractors. The problem is modeled as a three-stage flexible flow shop, where the fi...

In this paper we address a scheduling problem taken from a label sticker manufacturing company. The production system is a two-stage hybrid flow shop with the characteristics of sequence-dependent setup time at stage 1, dedicated machines at stage 2, and two due dates. The objective is to schedule one day’s mix of label stickers through the shop such that the weighted maximal tardiness is minim...

The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...