This article is a comprehensive review of Branch-and-Bound algorithms for solving flowshop
scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and …

This paper presents a literature review of flow-shop scheduling problems with transportation
or delivery of jobs. Flow-shop scheduling problems are one of the most widely studied …

In this work, we introduce a generalized flexible job-shop scheduling problem in which,
besides the classical constraints of the flexible job shop scheduling problem other hard …

This paper focuses on two components of idle time and waiting time, namely core idle
time,∑ CIT i, and core waiting time,∑ CWT j. Both measures are relevant indicators of the …

In this paper, we consider flow shop scheduling problems for jobs with time constraints
between consecutive process steps. We start by analyzing different types of time constraints …

This paper considers the flow shop scheduling problem with minimum and maximum time-
lag requirements. According to the time-lag constraints, the starting time of each operation of …

This paper considers the permutation flow shop scheduling problem with minimal and
maximal time lags. Time lags are defined as intervals of time that must exist between every …

Wafer quality issues are becoming essential concerns in semiconductor manufacturing
industry. It is becoming increasingly important for fab managers to raise the wafer quality …

A permutation flowshop with time lag constraints requires that the time lag between
consecutive operations of a job must be in the given interval. In this study, the scheduling of …

This paper studies the permutation flowshop scheduling problem with sequence dependent
setup times and time lags constraints minimizing the number of tardy jobs. Dependent setup …