Specific scheduling problems with complex hybrid logical and terminal constraints, non-stationarity in process execution as well as complex interrelations between dynamics in process design, capacity utilization, and machine setups require further investigation and the application of a broad...

A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort. An algorithm is also developed to minimize the required number...

Parallel machine structure is very common in modern production systems. Its performance sometimes has a decisive impact on the whole productivity. In this paper, we consider a parallel-machine scheduling problem where each machine is subject to periodic maintenance. Instead of assuming all the...

Flow shop scheduling is common in modern lean production systems. In practice, jobs in flow shops can arrive at irregular times. However, scheduling that considers such irregularity has not been adequately investigated in the literature. In this paper, we examine the scheduling of n-jobs in an...

Alternative machines assignment, machine sharing, and inter-cell movements are very common yet difficult to be solved integratedly in modern dynamic Cellular Manufacturing Systems (CMS). In this paper, we incorporate these issues and consider a dynamic cellular scheduling problem with flexible...