This paper addresses the two-machine flowshop scheduling problemwith separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are dev...

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

In production planning, sequence dependent setup times and costs are often incurred for switchovers from one product to another. When setup times and costs do not respect the triangular inequality, a situation may occur where the optimal solution includes more than one batch of the same product in a single period — in other words, at least one sub tour exists in the production sequence of that ...