Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

This paper addresses a complex parallel machine scheduling problem with jobs divided into operations and grouped in families. Non-anticipatory family setup times are held at the beginning of each batch, defined by combination one setup-time sequence from unique family. Other aspects also considered problem, such as release dates for machines, operation’s sizes, machine’s eligibility capacity. W...

<p style='text-indent:20px;'>In this research, a parallel machine sequence-dependent group scheduling problem with the goal of minimizing total weighted earliness and tardiness is investigated. First, mathematical model developed for research which can be used solving small-sized instances. Since shown to NP-hard, focuses on proposing meta-heuristic algorithms finding near-optimal solutio...

The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...

In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...