Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time
From MaRDI portal
Publication:3004670
DOI10.1007/978-3-642-21204-8_24zbMath1329.90056OpenAlexW190212481MaRDI QIDQ3004670
An Zhang, Yong Chen, Zhiyi Tan
Publication date: 3 June 2011
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_24
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Single machine flow-time scheduling with scheduled maintenance
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Operator non-availability periods
- Single machine flow-time scheduling with a single breakdown
- Non-preemptive two-machine open shop scheduling with non-availability constraints
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Machine scheduling with an availability constraint
This page was built for publication: Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time
