In this paper, we study a surgical cases assignment problem (SCAP) of assigning a set of surgical cases to several multifunctional operating rooms with an objective of minimizing total operating cost. Firstly, we formulate this problem as an integer problem and then reformulate the integer...

No-wait re-entrant robotic flowshops are widely used in the electronic industry, such as PCB and semiconductor manufacturing. In such an industry, cyclic production policy is often used due to large lot size and simplicity of implementation. This paper addresses cyclic scheduling of a no-wait...

In this article, we consider the single-machine scheduling problem with one availability constraint. We aim to minimize the weighted sum of completion times. We propose a branch-and-bound algorithm based on a set of improved lower bounds and heuristics. The numerical experiments show the...

In this note, we study parallel machine scheduling problem with past-sequence-dependent delivery times and a deterioration effect. We present polynomial algorithms for the problem with the total workload, the total completion time, the total absolute differences in completion times objectives.

This research aims to build a feasible and efficient operating program for an endoscopy centre composed of two specialised operating rooms for one week, with the objective of both maximising the utilisation of the operating room and minimising the cost of overtime. First, a tactical planning...