We study a 2-machine flowshop in which all processing times are independently and identically distributed, with values known to the scheduler. We are able to describe in detail the expected behavior of the flowshop under optimal and under heuristic schedules. Our results suggest that minimizing makespan might be a superfluous objective: Scheduling the jobs randomly requires less information and...

We treat the problem of scheduling a owshop with pallet requirements. Each job in the owshop needs a pallet the entire time, from the start of its rst operation until the completion of the last operation, and the number of pallets in the shop at any given time is limited by an integer K. We prove that the problem is NP-hard in the strong sense for m 2 and K 3, and for m 3 and K 2, where m is th...

Permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) and makespan minimisation is NP-hard. It has important practical applications, for example, in the cider industry print industry. There exist several metaheuristic algorithms to solve this problem. However, within time limits, those still either find low quality solutions or struggle large problems. In paper...

In this study, a two-machine flowshop producing identical parts is considered. Each of the identical parts is assumed to require a number of manufacturing operations, and the machines are assumed to be flexible enough to perform different operations. Due to economical or technological constraints, some specific operations are preassigned to one of the machines. The remaining operations, called ...

The availability of the machine is one of the most important assumptions on many scheduling problems under any situation. However, in most actual life manufacturing settings a machine can be unavailable for many reasons, such as unforeseen scheduled preventive. In this paper, we study scheduling flowshops problem under ’condition based’ maintenance constraints to minimize the expected makespan ...

Motivated by the current research in data centers and cloud computing, we study the problem of scheduling a set of two-stage jobs on multiple two-stage flowshops. A new formulation for configurations of such scheduling is proposed, which leads directly to improvements to the complexity of scheduling algorithms for the problem. Motivated by the observation that the costs of the two stages can be...

We address the four-machine flowshop scheduling problem with objective of minimizing makespan uncertain processing times The was addressed in literature (RAIRO Operations Research 54, 529-553) and different algorithms were proposed. In this paper, we propose a new algorithm for problem. proposed is compared best by using extensive computational experiments. Computational experiments indicate th...