The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

DOI10.1016/J.TCS.2008.02.015zbMath1145.68007OpenAlexW2012296215MaRDI QIDQ924160

Jinjiang Yuan, Ling-Fa Lu, Li-Qi Zhang

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.015

zbMATH Keywords

scheduling rejection penalty fully polynomial-time approximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (33)

Scheduling a single machine with parallel batching to minimize makespan and total rejection cost ⋮ Scheduling with release times and rejection on two parallel machines ⋮ In-house production and outsourcing under different discount schemes on the total outsourcing cost ⋮ The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost ⋮ Single Machine Scheduling with an Availability Constraint and Rejection ⋮ Scheduling with partial rejection ⋮ Single-machine scheduling with production and rejection costs to minimize the maximum earliness ⋮ Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine ⋮ A survey on offline scheduling with rejection ⋮ Graph multi-coloring for a job scheduling application ⋮ Serial batch scheduling on uniform parallel machines to minimize total completion time ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Penalty cost constrained identical parallel machine scheduling problem ⋮ Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions ⋮ Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines ⋮ A bicriteria approach to scheduling a single machine with job rejection and positional penalties ⋮ Single-machine scheduling and due date assignment with rejection and position-dependent processing times ⋮ Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups 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 a bounded parallel-batching machine with incompatible job families and rejection ⋮ Batch scheduling with proportional-linear deterioration and outsourcing ⋮ TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION ⋮ Scheduling with job-rejection and position-dependent processing times on proportionate flowshops ⋮ Single-machine scheduling under the job rejection constraint ⋮ Order acceptance and scheduling with machine availability constraints ⋮ Two-machine flow-shop scheduling with rejection ⋮ Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment ⋮ Minimizing the makespan on a single parallel batching machine ⋮ Minmax scheduling and due-window assignment with position-dependent processing times and job rejection ⋮ Bounded single-machine parallel-batch scheduling with release dates and rejection ⋮ Single machine scheduling with release dates and rejection ⋮ Two-agent scheduling with rejection on a single machine ⋮ Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects

Cites Work

This page was built for publication: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan