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

DOI10.1016/j.tcs.2008.02.015zbMath1145.68007MaRDI 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

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects, TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION, Scheduling a single machine with parallel batching to minimize makespan and total rejection cost, The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost, A survey on offline scheduling with rejection, Serial batch scheduling on uniform parallel machines to minimize total completion time, A bicriteria approach to scheduling a single machine with job rejection and positional penalties, Scheduling a bounded parallel-batching machine with incompatible job families and rejection, Scheduling with job-rejection and position-dependent processing times on proportionate flowshops, Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment, Penalty cost constrained identical parallel machine scheduling problem, Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines, Single-machine scheduling under the job rejection constraint, Bounded single-machine parallel-batch scheduling with release dates and rejection, Single machine scheduling with release dates and rejection, Graph multi-coloring for a job scheduling application, Two-machine flow-shop scheduling with rejection, Order acceptance and scheduling with machine availability constraints, Minimizing the makespan on a single parallel batching machine, Scheduling with release times and rejection on two parallel machines, Single-machine scheduling with production and rejection costs to minimize the maximum earliness, Single-machine scheduling and due date assignment with rejection and position-dependent processing times, Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost, Single Machine Scheduling with an Availability Constraint and Rejection

Cites Work

• Unnamed Item
• Scheduling a batching machine
• Preemptive scheduling with rejection
• On scheduling an unbounded batch machine
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Complexity results for single-machine problems with positive finish-start time-lags
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Preemptive multiprocessor scheduling with rejection