Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines
From MaRDI portal
Publication:290334
DOI10.1007/S40305-015-0093-ZzbMATH Open1338.90175OpenAlexW1216488046MaRDI QIDQ290334FDOQ290334
Authors: Ran Ma, Jinjiang Yuan 
Publication date: 1 June 2016
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-015-0093-z
Recommendations
- Online scheduling to minimize the total weighted completion time plus the rejection cost
- On-line scheduling with rejection on identical parallel machines
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- A special case of on-line scheduling on two uniformly machines with rejection
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Scheduling with machine cost and rejection
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Multiprocessor Scheduling with Rejection
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- Preemptive multiprocessor scheduling with rejection
Cited In (13)
- Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
- On-line scheduling with rejection on identical parallel machines
- Parameter learning online algorithm for multiprocessor scheduling with rejection
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time
- Online scheduling with machine cost and rejection
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode
- Scheduling with machine cost and rejection
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
- Online scheduling with rejection and withdrawal
- Scheduling with rejection to minimize the total weighted completion time
This page was built for publication: Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290334)
