Supply chain scheduling problem in the hospital with periodic working time on a single machine
From MaRDI portal
Publication:887873
DOI10.1007/s10878-015-9857-yzbMath1327.90081MaRDI QIDQ887873
Publication date: 3 November 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9857-y
branch-and-bound algorithm; approximation algorithm; supply chain scheduling; periodic maintenance; nonresumable job
90C59: Approximation methods and heuristics in mathematical programming
90B25: Reliability, availability, maintenance, inspection in operations research
90B36: Stochastic scheduling theory in operations research
Related Items
An integrated method to solve the healthcare facility layout problem under area constraints, Real-time scheduling optimization considering the unexpected events in home health care, Two-stage medical supply chain scheduling with an assignable common due window and shelf life, Medical rolling bearing fault prognostics based on improved extreme learning machine, A multi-objective and multi-period optimization model for urban healthcare waste's reverse logistics network design, Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode, A three-stage supply chain scheduling problem based on the nursing assistants' daily work in a hospital, Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance
Cites Work
- Integrated scheduling of production and delivery on a single machine with availability constraint
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- Single machine flow-time scheduling with scheduled maintenance
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Improved algorithms for two single machine scheduling problems
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Single machine flow-time scheduling with a single breakdown
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Blow-up and global existence of solutions for a nonlocal degenerate parabolic system
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Machine scheduling with an availability constraint
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Scheduling the maintenance on a single machine
- Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
- Machine scheduling with an availability constraint and job delivery coordination
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
