Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs
From MaRDI portal
Publication:3163792
DOI10.1080/00207540802446795zbMath1197.90225OpenAlexW2028953682WikidataQ58644692 ScholiaQ58644692MaRDI QIDQ3163792
Publication date: 26 October 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://rmit-researchmanagement.esploro.exlibrisgroup.com/view/delivery/61RMIT_INST/12246482100001341/13248387140001341
Cites Work
- Unnamed Item
- Single machine flow-time scheduling with scheduled maintenance
- Single machine flow-time scheduling with a single breakdown
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Machine scheduling with availability constraints
- Minimizing the sum of job completion times on capacitated parallel machines
- Current trends in deterministic scheduling
- Machine scheduling with a rate-modifying activity
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Scheduling with limited machine availability
- Parallel-machine scheduling under potential disruption
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
- Machine scheduling with an availability constraint
- Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
- Single-machine scheduling with flexible and periodic maintenance
- `` Strong NP-Completeness Results
- Single machine scheduling with a restricted rate-modifying activity
- Scheduling jobs and maintenance activities on parallel machines
This page was built for publication: Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs
