Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection

DOI10.1007/s10951-022-00745-7zbMath1517.90038OpenAlexW4295995965WikidataQ114225417 ScholiaQ114225417MaRDI QIDQ6103749

Matan Atsmony, Gur Mosheiov

Publication date: 27 June 2023

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

Full work available at URL: https://doi.org/10.1007/s10951-022-00745-7

zbMATH Keywords

schedulingdynamic programmingjust-in-timeparallel identical machinesjob-rejection

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost

Cites Work

• A survey on offline scheduling with rejection
• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
• Maximizing the weighted number of just-in-time jobs in flow shop scheduling
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines
• Approximation algorithms for precedence-constrained identical machine scheduling with rejection
• Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
• A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
• Single machine scheduling to minimize the number of early and tardy jobs
• Rescheduling under disruptions in manufacturing systems. Models and algorithms
• Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
• Regular scheduling measures on proportionate flowshop with job rejection
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
• Interval scheduling on identical machines
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
• Single-machine batch scheduling problem with job rejection and resource dependent processing times
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
• On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops