In this study, we consider a flexible manufacturing cell (FMC) processing identical parts on which the loading and unloading of machines are made by a robot. The machines used in FMCs are predominantly CNC machines and these machines are flexible enough for performing several operations provided that the required tools are stored in their tool magazines. Traditional research in this area consid...

This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and parallel machine problems by considering stages with parallel machines instead of having one single machine per stage. We also investigate the flexible version where stage skipping might occur, i.e., not all stages must be vi...

In this research, we consider a two-machine permutation flowshop with ready times and limited waiting times of jobs in a semiconductor fab. In the flowshop, each job has its corresponding ready time (arrival time) at machine 1 (for the first operation) and limited waiting time between the completion time of the first operation on machine 1 and the starting time of the second operation on machin...

In this work, we introduce the Flowshop Scheduling Problem with Delivery Dates and Cumulative Payoffs. This problem is a variation of the flowshop scheduling problem with job release dates that maximizes the total payoff with a stepwise job objective function. This paper contributes towards proposing a mathematical formulation for this new problem and an original constructive heuristic. Additio...

Automatic performance analysis of parallel programs can be accomplished by scanning event traces of program execution for patterns representing inefficient behavior. The temporal and spatial relationships between individual runtime events recorded in the event trace allow the recognition of wait states as a result of suboptimal parallel interaction. In our earlier work [1], we have shown how pa...

In this paper, we address the problem of scheduling a set of jobs in a flowshop with makespan objective. In contrast to the usual assumption of machine availability presented in most research, we consider that machines may not be available at the beginning of the planning period, due to processing of previously scheduled jobs. We first formulate the problem, analyse the structure of solutions d...

This paper discusses a two-stage assembly-type flowshop scheduling problem with batching considerations subject to a fixed job sequence. The two-stage assembly flowshop consists of m stage-1 parallel dedicated machines and a stage-2 assembly machine which processes the jobs in batches. Four regular performance metrics, namely, the total completion time, maximum lateness, total tardiness, and nu...

This paper considers the relocation problem arising from public re-development projects cast as a two-machine flowshop scheduling problem. In such a project, some buildings need to be torn down and re-constructed. The two processes of tearing down and re-constructing each building are often viewed as a single operation. However, under certain circumstances, the re-construction process, i.e., th...

The flowshop scheduling problems with n jobs processed on two or three machines, and with two jobs processed on k machines are addressed where jobs have random and bounded processing times. The probability distributions of random processing times are unknown, and only the lower and upper bounds of processing times are given before scheduling. In such cases, there may not exist a unique schedule...

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the setup ...