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

A bicriteria approach to scheduling a single machine with job rejection and positional penalties, Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment, 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, Two-machine flow-shop scheduling with rejection, Minimizing the makespan on a single parallel batching machine

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