This paper studies the two-stage no-wait hybrid flow shop scheduling problem with inter-stage flexibility. The problem is inspired from hospital operating room scheduling under limited healthcare resources. We
However, to the best of our knowledge, there is no research combines these two algorithms together to solve the two-stage hybrid flow shop scheduling problem on parallel-batching machines considering deteriorating effect and non-identical job sizes simultaneously. An extensive study of different models...
Yang, J.: A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines. Int. J. Prod. Res. 48(5), 1531–1538 (2010) Article MATH Google Scholar Yu, X., Zhang, Y., Huang, K.: Multi-machine scheduling with general position-based deterioration ...
This research investigates a two-stage no-wait hybrid flow-shop scheduling problem in which the first stage contains a single machine, and the second stage contains several identical parallel machines. The objective is to minimise the makespan. For this problem, existing literature emphasises on heur...
Gupta and Tunc [4] considered a two-stage hybrid flow shop scheduling problem with parallel machines only at the second stage and suggest heuristic algorithms for the objective of minimizing makespan. Other heuristics with the makespan measure in two-stage hybrid flow shops were suggested by Lee ...
hybrid flow shop scheduling problem in this paper. Also, as one of the practical reasons, we consider system throughput as well as satisfying due dates with a certain allowance at the same time. Most previous research articles on hybrid flow shop ...
A hybrid two-stage flowshop scheduling problem was considered which involves m identical parallel machines at Stage 1 and a burn-in processor M at Stage 2, and the makespan was taken as the minimization objective. This scheduling problem is NP-hard in general. We divide it into eight subcase...
scheduling problem in hybridflow shops that consist of two stages in series, each ofwhich has multiple identical parallel machines. Each jobhas reentrant flow, i.e., the job visits each production stageseveral times. The problem is to determine the allocation ofjobs to machines as well as the...
Hybrid flow shops are also known as flexible flow shops. The concept includes the feature of the machine assignment flexibility introduced by such a configuration compared to a classical flow shop. Many researchers studied the hybrid flow shop scheduling problem with and without additional constraints....
This research investigates a two-stage hybrid flowshop scheduling problem in a metal-working company. The first stage consists of multiple parallel machines and the second stage has only one machine. Four characteristics of the company have substantiated the complexity of the problem. First, all mac...