In this research, a permutation flowshop sequence-dependent group scheduling problem with minimisation of total completion time is considered. Since the problem is shown to be strongly NP-hard, a hybrid genetic (HG) algorithm is proposed. The only available lower bounding (LB) method for the...

Acyclic phase-type distributions form a versatile model, serving as approximations to many probability distributions in various circumstances. They exhibit special properties and characteristics that usually make their applications attractive. Compared to acyclic continuous phase-type (ACPH)...

The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital's demand during the planning horizon by considering different objective functions. In this research, we focus on...

This paper focuses on the flow shop sequence dependent group scheduling (FSDGS) problem with minimisation of total completion time as the criterion (Fm|f<SUB align="right"><SMALL>mls</SMALL></SUB>, prmu, S<SUB align="right"><SMALL>plk</SMALL></SUB>|ΣC<SUB align="right"><SMALL>J</SMALL></SUB>). The research problem is formulated in form of two different mixed integer linear programming (MILP) models. Comparing...</small></sub></small></sub></small></sub>