In this paper a problem of scheduling a single machine under linear deterioration which aims at minimizing the number of tardy jobs is considered. According to our assumption, processing time of each job is dependent on its starting time based on a linear function where all the jobs have the...

The job-shop scheduling problem is one of the most arduous combinatorial optimization problems. Flexible job-shop problem is an extension of the job-shop problem that allows an operation to be processed by any machine from a given set along different routes. This paper present a new approach...

The efficient and effective management of nursing personnel is of critical importance in a hospital’s environment comprising approximately 25 % of the hospital’s operational costs. The nurse organizational structure and the organizational processes highly affect the nurses’ working...

The efficient and effective management of nursing personnel is of critical importance in a hospital's environment comprising a vast share of the operational costs. The adopted nurse workforce practices and policies highly affect the nurses' working conditions and the provided quality of care....

The crew scheduling problem in the airline industry is extensively investigated in the operations research literature since efficient crew employment can drastically reduce operational costs of airline companies. Given the flight schedule of an airline company, crew scheduling is the process of...

Due to its complexity and relevance in practice, many different procedures have been proposed in the operations research literature to solve the well-known nurse scheduling problem (NSP). The NSP assigns nurses to shifts per day maximizing the overall quality of the roster while taking various...