Online single-processor scheduling with an unexpected breakdown
From MaRDI portal
Publication:6561564
DOI10.1142/S0217595923500057zbMATH Open1542.90097MaRDI QIDQ6561564FDOQ6561564
Authors: Sainan Guo, Yannan Chen, Yaping Mao, Xiaoyan Zhang 
Publication date: 25 June 2024
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling with limited machine availability
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
- Semi-online scheduling on a single machine with unexpected breakdown
- Minimizing total weighted completion time with an unexpected machine unavailable interval
- LP-based online scheduling: From single to parallel machines
- Title not available (Why is that?)
- Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time
- Online scheduling of jobs with favorite machines
- Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
- A note on minimizing total weighted completion time with an unexpected machine unavailable interval
- Online scheduling of ordered flow shops
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Machine scheduling with soft precedence constraints
This page was built for publication: Online single-processor scheduling with an unexpected breakdown
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561564)
