Pages that link to "Item:Q2253473"

The following pages link to A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital (Q2253473):

Displaying 33 items.

• Scheduling the hospital-wide flow of elective patients (Q297017) (← links)
• Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays (Q309052) (← links)
• Surgical scheduling with simultaneous employment of specialised human resources (Q319663) (← links)
• Integrating soft and hard operational research to improve surgical centre management at a university hospital (Q319698) (← links)
• Scheduling operating theatres: mixed integer programming vs. constraint programming (Q320002) (← links)
• Integer linear programming models for the skiving stock problem (Q322686) (← links)
• Scheduling operating rooms: achievements, challenges and pitfalls (Q341461) (← links)
• The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
• Sequencing surgical cases in a day-care environment: an exact branch-and-price approach (Q1010278) (← links)
• The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
• An integrated approach for scheduling health care activities in a hospital (Q1681540) (← links)
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← links)
• Integer rounding and modified integer rounding for the skiving stock problem (Q1751167) (← links)
• Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling (Q1751262) (← links)
• Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
• Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling (Q1752822) (← links)
• Operating room scheduling by considering the decision-making styles of surgical team members: a comprehensive approach (Q2003431) (← links)
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
• Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut (Q2030502) (← links)
• A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering (Q2173057) (← links)
• Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs (Q2292140) (← links)
• A fuzzy robust stochastic mathematical programming approach for multi-objective scheduling of the surgical cases (Q2329568) (← links)
• Large proper gaps in bin packing and dual bin packing problems (Q2423816) (← links)
• Operating room planning and surgical case scheduling: a review of literature (Q2424648) (← links)
• Surgical case scheduling as a generalized job shop scheduling problem (Q2464181) (← links)
• A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling (Q2830948) (← links)
• Collaborative Operating Room Planning and Scheduling (Q4599323) (← links)
• Adaptive Bin Packing with Overflow (Q5870378) (← links)
• A simulated annealing for a daily operating room scheduling problem under constraints of uncertainty and setup (Q5882403) (← links)
• Adopting a hierarchical diagnosis and treatment system to optimize elective surgery scheduling (Q6047887) (← links)
• A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints (Q6164341) (← links)
• Stochastic weekly operating room planning with an exponential number of scenarios (Q6179190) (← links)
• Optimization for surgery department management: an application to a hospital in Naples (Q6619796) (← links)