Owing to intense global competition, one of the main concerns of the production-scheduling literature is the modelling and the optimisation of the robotic cells. In this type of cell, as in a classical flowshop, each part follows the same processing order on all machines. The objective is the minimisation of the cycle time. To efficiently exploit the potential of such cells, an algorithmic framework to a variety of challenging NP-hard optimisation problems is required. In this paper we consider the problem of scheduling operations in a three-machine robotic cell producing multiple part types. Besides the part sequence, the sequence of robot moves must be optimised as well. The simultaneous optimisation of the sequences of part and of robot activities has rarely been tackled in the literature. In addition, most studies restrict the search of the best MPS cycle to CRM sequences or to the combination of one-unit cycles despite the fact that these restrictions may not lead to the optimality. This paper attempts to fill this gap by providing a constructive heuristic based on specific features of the problem. The reported computational tests provide clear evidence that this new way to tackle the problem is promising.
Purpose: The purpose of this paper is to generate a daily operating theater schedule aiming to minimize completion time and maximum overtime while integrating real-life surgeon constraints, such as their role, specialty, qualification and availability.Design/methodology/approach: The paper deals with complete surgery process using multi-objective surgery scheduling approach. Furthermore, the combinatorial nature of the studied problem does not allow to solve it to optimality. Therefore, the authors developed two approaches embedded in a tabu search metaheuristic, namely, weighted sum and e-constraint, to minimize completion time and maximum overtime.Findings: The integration of the upstream and downstream services of an intervention and the consideration of the specific constraints related to surgeons are very essential to obtaining more closed schedules to the realty.Practical implications: The paper includes implications for the development of efficient schedules for a significant number of operations coming from different specialties throughout its complete surgery process under multi-resource constraints.Social implications: The paper can help hospital managers and decision makers to well manage the budget by minimizing the overtime cost and by offering efficient daily operating theater schedule.Originality/value: The results of the paper will help hospital managers and decision makers to well manage the budget by minimizing the overtime cost and offering efficient daily operating theater schedule.
16 July 2008 in Journal of Systems Science and Systems Engineering
This paper shows how to solve two-part sequencing problems in a three-machine robotic cell so as to minimize the cycle time. We start dealing with cycles whose associated part-sequencing problems do not have the structure of a travelling salesman problem (TSP). The idea behind our approach is to modify the waiting time formula and formulate the closely related modified problem as a generalized travelling salesman problem (GTSP). The other cycles to be tackled are those that have a TSP structure for their associated part-sequencing problem. The existence of common states between these cycles allows us to mix and mould all of them into a GTSP. The solution procedures, designed for both cycle classes, are merged into a single heuristic and evaluated. The computational results provided prove the efficiency of the approaches.
1 January 2023 in Yugoslav Journal of Operations Research
Mathematical programming, and above all, the multi-objective scheduling problems stand as remarkably versatile tools, highly useful for optimizing the health care services. In this context, the present work is designed to put forward two-fold multi-objective mixed integer linear programs, simultaneously integrating the objectives of minimizing the patients? total waiting and flow time, while minimizing the doctors' work-load variations. For this purpose, the three major health-care system intervening actors are simultaneously considered, namely, the patients, doctors and machines. To the best of our knowledge, such an issue does not seem to be actually addressed in the relevant literature. To this end, we opt for implementing an appropriate lexicographic method, whereby, effective solutions enabling to minimize the performance of two-objective functions could be used to solve randomly generated small cases. Mathematical models of our study have been resolved using the CPLEX software. Then, results have been comparatively assessed in terms of both objectives and CPU times. A real laser-treatment case study, involving a set of diabetic retinopathy patients in the ophthalmology department in Habib Bourguiba Hospital in Sfax, Tunisia, helps in illustrating the effective practicality of our advanced approach. To resolve the treated problem, we use three relevant heuristics which have been compared to the first-come first-served rule. We find that the program based on our second formulation with time-limit provided the best solution in terms of total flow time.
1 January 2025 in Yugoslav Journal of Operations Research
The World Health Report estimated that 20-40% of health sector resources are wasted globally. Balancing many conflicting objectives such as clinical excellence, cost containment, and patient satisfaction can be challenging. In fact, multiple objective programming is one of the best tools that can be used for logistics optimization in many organizations. The aim of our paper is to propose a multi-objective mixed integer linear program that satisfies the goals of two important actors in the healthcare system: patients and doctors. The problem considers a parallel machine scheduling model that integrates simultaneously the following most known objectives in healthcare systems: minimization of the makespan, the patients' total flow times, and the doctors' workloads variations. The current paper deals with a real case study where the number of doctors exceeds the number of machines. A mathematical model combined with some dispatching rules was developed and solved using the CPLEX software, which shows the practical importance of our approach. For small instances, we use a mathematical programming model and a heuristic method based on the ?first come, first served? rule to assign patients to machines and doctors. For larger instances, we use a genetic algorithm to approximately solve our multi-objective model.