Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines

DOI10.1007/s40305-015-0093-zzbMath1338.90175OpenAlexW1216488046MaRDI QIDQ290334

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

zbMATH Keywords

schedulingonline algorithmsrejectiontotal weighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times ⋮ A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem 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 ⋮ Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode

Cites Work

• 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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