An improved heuristic for parallel machine scheduling with rejection

DOI10.1016/j.ejor.2014.09.028zbMath1339.90148MaRDI QIDQ2629711

Jinwen Ou, Guoqing Wang, Xueling Zhong

Publication date: 6 July 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.09.028

zbMATH Keywords

schedulingheuristicrejectionworst-case bound

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

68W10: Parallel algorithms in computer science

Related Items

Vector scheduling with rejection on two machines, Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates, Algorithms for single machine scheduling problem with release dates and submodular penalties, On-line single machine scheduling with release dates and submodular rejection penalties, Order acceptance and scheduling with consideration of service level, Scheduling with job-rejection and position-dependent processing times on proportionate flowshops, Improved approximation algorithms for parallel machine scheduling with release dates and job rejection, New approximation algorithms for machine scheduling with rejection on single and parallel machine, Minimizing maximum delivery completion time for order scheduling with rejection, A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling, Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection, Two-agent parallel-machine scheduling with rejection, Bicriteria order acceptance and scheduling with consideration of fill rate, Exact methods for order acceptance and scheduling on unrelated parallel machines, A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection, Vector scheduling with rejection on a single machine, Minmax scheduling and due-window assignment with position-dependent processing times and job rejection, Minimizing total late work on a single machine with generalized due-dates, Approximation algorithms for the multiprocessor scheduling with submodular penalties, A matheuristic for the generalized order acceptance and scheduling problem, Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times, Flowshop scheduling with learning effect and job rejection, Scheduling with release times and rejection on two parallel machines, Parallel machine scheduling with restricted job rejection, Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics, On the mass COVID-19 vaccination scheduling problem, Coordinated scheduling of the outsourcing, in-house production and distribution operations, A Review for Submodular Optimization on Machine Scheduling Problems

Cites Work

• Unnamed Item
• A survey on offline scheduling with rejection
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Order acceptance with weighted tardiness
• Scheduling linear deteriorating jobs with rejection on a single machine
• Order acceptance using genetic algorithms
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Single machine scheduling with release dates and rejection
• Preemptive scheduling with rejection
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Order acceptance and scheduling with machine availability constraints
• Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed
• Selecting jobs for heavily loaded shop with lateness penalties
• Multiprocessor Scheduling with Rejection
• Scheduling
• Preemptive multiprocessor scheduling with rejection