English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The surgical scheduling problem that incorporates the surgical duration, the setup time, the turnover time and the due time is studied in this paper. The actual surgical duration is affected by the normal duration, the surgical sequence, the accumulated experience of surgical teams and a controlling parameter. Besides, the surgical duration, the setup time and the turnover time are affected by the deteriorating effect, which means when the start time, the setup time or the turnover time of a surgery is postponed, the actual duration, the actual setup time or the actual turnover time will be prolonged. A schedule problem is formulated to minimize the maximum surgical tardiness. By building and analyzing the surgical scheduling model, each surgical team should operate surgeries according to a non-decreasing order of patients’ normal surgical duration. Furthermore, a branch-and-bound algorithm is provided to solve the surgical teams scheduling problem. Our experimental results show the effectiveness and stability of our proposed algorithm.

Multiple Due Time Surgical Scheduling With Truncated Learning and Deteriorating Effect