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...

PT OSIN is a company that runs business in the automotive manufacturing sector. The applies flow shop production model whose pattern line to series using First Come Serve scheduling method. problem with FCFS method which considered have not reached optimal enough meeting uncertain product demands, causing delays schedule, has an impact on or distribution of goods and can lead increased activiti...

This paper is survey of hybrid flow shop scheduling problems. An HFS scheduling problem is a classical flow-shop in which parallel machines are available to perform the same operation. Most real world scheduling problems are NP-hard in nature. The hybrid flow shop scheduling problems have received considerable research attention. The several optimization and heuristic solution procedures are av...

Multiple resource co-scheduling algorithms and pipelined execution models are becoming increasingly popular, as they better capture the heterogeneous nature of modern architectures. The problem of scheduling tasks composed of multiple stages tied to different resources goes under the name of “flow-shop scheduling”. This problem, studied since the ’50s to optimize production plants, is known to ...

Experiments were conducted with a simulation model of a flow shop with prohibited early shipments under a wide variety of conditions including congestion, which was modeled separately as “blocking” and as “material handling cost (MHC).” Congestion was found to significantly degrade most standard measures of shop performance, with stronger effects at high utilization and with blocking. Contrary ...

We consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson’s rule. For m = 2, we present a 32 -approximation algorithm, and for m = 3, we present a 12 7 -approximation algori...