A survey on offline scheduling with rejection

From MaRDI portal

Publication:398830

Jump to:navigation, search

DOI10.1007/s10951-012-0303-zzbMath1297.90058OpenAlexW1988565742MaRDI QIDQ398830

Moshe Kaspi, Dvir Shabtay, Nufar Gaspar

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-012-0303-z

zbMATH Keywords

deterministic scheduling order acceptance job rejection optimization and complexity sourcing decisions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (only showing first 100 items - show all)

Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs ⋮ Machine scheduling with job rejection and Dejong's learning effect ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines ⋮ The constrained parallel-machine scheduling problem with divisible processing times and penalties ⋮ Order acceptance and scheduling with delivery under generalized parameters ⋮ Designs for Order-of-Addition Screening Experiments ⋮ Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection ⋮ Minsum scheduling with acceptable lead-times and optional job rejection ⋮ Scheduling a single machine with parallel batching to minimize makespan and total rejection cost ⋮ Scheduling lower bounds via AND subset sum ⋮ Scheduling with release times and rejection on two parallel machines ⋮ Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times ⋮ Two-machine open-shop scheduling with rejection to minimize the makespan ⋮ Faster algorithms for single machine scheduling with release dates and rejection ⋮ New results on two-machine flow-shop scheduling with rejection ⋮ In-house production and outsourcing under different discount schemes on the total outsourcing cost ⋮ New approximation algorithms for machine scheduling with rejection on single and parallel machine ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization ⋮ Parallel-machine scheduling with release dates and rejection ⋮ The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost ⋮ Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs ⋮ An improved heuristic for parallel machine scheduling with rejection ⋮ A general scheme for solving a large set of scheduling problems with rejection in FPT time ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A greedy heuristic for solving scheduling problems with bounded rejection cost ⋮ Single machine scheduling with rejection and generalized parameters ⋮ Single machine scheduling with rejection to minimize the weighted makespan ⋮ Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints ⋮ 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 ⋮ Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties ⋮ An analysis of the non-preemptive mixed-criticality match-up scheduling problem ⋮ On the fine-grained parameterized complexity of partial scheduling to minimize the makespan ⋮ Parallel machine scheduling with restricted job rejection ⋮ Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties ⋮ Single machine scheduling with non-availability interval and optional job rejection ⋮ Scheduling with partial rejection ⋮ The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times ⋮ Two-agent parallel-machine scheduling with rejection ⋮ Single-machine scheduling with production and rejection costs to minimize the maximum earliness ⋮ Online scheduling to minimize the total weighted completion time plus the rejection cost ⋮ Scheduling with competing agents, total late work and job rejection ⋮ Replication and sequencing of unreliable jobs on parallel machines ⋮ Learning variable neighborhood search for a scheduling problem with time windows and rejections ⋮ Coordinated scheduling of the outsourcing, in-house production and distribution operations ⋮ Bicriteria order acceptance and scheduling with consideration of fill rate ⋮ Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties ⋮ Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection ⋮ Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost ⋮ Serial batch scheduling on uniform parallel machines to minimize total completion time ⋮ Fixed interval scheduling with third‐party machines ⋮ Due-window assignment scheduling with job-rejection, truncated learning effects and setup times ⋮ Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times ⋮ Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection ⋮ Scheduling problems with rejection to minimize the maximum flow time ⋮ Penalty cost constrained identical parallel machine scheduling problem ⋮ Minmax scheduling problems with common due-date and completion time penalty ⋮ Parallel-batch scheduling with deterioration and rejection on a single machine ⋮ Proportionate Flow Shop Scheduling with Rejection ⋮ Approximation algorithms for precedence-constrained identical machine scheduling with rejection ⋮ Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines ⋮ Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection ⋮ Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection ⋮ Flowshop scheduling with learning effect and job 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 simple linear deteriorating jobs with rejection ⋮ A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization ⋮ Single-machine scheduling with maintenance activities and rejection ⋮ Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints ⋮ 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 ⋮ Scheduling a bounded parallel-batching machine with incompatible job families and rejection ⋮ Supply chain scheduling to minimize holding costs with outsourcing ⋮ Vector scheduling with rejection on a single machine ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ The prize-collecting scheduling problem with deadlines ⋮ Improved approximation algorithms for parallel machine scheduling with release dates and job rejection ⋮ Order acceptance and scheduling with consideration of service level ⋮ On the parameterized tractability of single machine scheduling with rejection ⋮ A single-machine scheduling problem with uncertainty in processing times and outsourcing costs ⋮ A constraint generation approach for two-machine shop problems with jobs selection ⋮ Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution ⋮ Scheduling with job-rejection and position-dependent processing times on proportionate flowshops ⋮ Order acceptance and scheduling with machine availability constraints ⋮ Multipurpose machine scheduling with rejection and identical job processing times ⋮ Analysis of flow shop scheduling anomalies ⋮ Single machine lot scheduling with optional job-rejection ⋮ Minmax scheduling and due-window assignment with position-dependent processing times and job rejection ⋮ An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem ⋮ Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Regular scheduling measures on proportionate flowshop with job rejection ⋮ New results for scheduling to minimize tardiness on one machine with rejection and related problems ⋮ Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine

Cites Work

This page was built for publication: A survey on offline scheduling with rejection

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:398830&oldid=12277039"