New approximation algorithms for machine scheduling with rejection on single and parallel machine
- 1 September 2020
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 40 (4) , 929-952
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11871213)
This publication has 21 references indexed in Scilit:
- Improved algorithms for single machine scheduling with release dates and rejections4OR, 2016
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection costInformation Processing Letters, 2013
- A tabu search algorithm for order acceptance and schedulingComputers & Operations Research, 2012
- Optimal algorithms for single-machine scheduling with rejection to minimize the makespanInternational Journal of Production Economics, 2011
- Scheduling linear deteriorating jobs with rejection on a single machineEuropean Journal of Operational Research, 2009
- On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times2006
- Techniques for scheduling with rejectionJournal of Algorithms, 2003
- Preemptive scheduling with rejectionMathematical Programming, 2003
- On-line scheduling of unit time jobs with rejection: minimizing the total completion timeOperations Research Letters, 2002
- Multiprocessor Scheduling with RejectionSIAM Journal on Discrete Mathematics, 2000