Scheduling a bounded parallel-batching machine with incompatible job families and rejection

DOI10.1007/S40305-014-0062-YzbMath1306.90056OpenAlexW2112736884MaRDI QIDQ489155

Ren-Xia Chen, Shi-Sheng Li

Publication date: 27 January 2015

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-014-0062-y

zbMATH Keywords

approximation algorithmrejectionincompatible job familiesparallel-batching scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• 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
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Parallel-machine scheduling with deteriorating jobs and rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Scheduling linear deteriorating jobs with rejection on a single machine
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
• Scheduling a batching machine
• Preemptive scheduling with rejection
• Approximation algorithms in batch processing
• Scheduling one batch processor subject to job release dates
• Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
• Scheduling with machine cost and rejection
• Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines
• The Batch Loading and Scheduling Problem
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection

This page was built for publication: Scheduling a bounded parallel-batching machine with incompatible job families and rejection