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

DOI10.1007/S40305-014-0062-YMaRDI QIDQ489155zbMATH OpenOpenAlexFDO

Authors Shisheng Li, Ren-Xia Chen

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

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

Recommendations

• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Batch scheduling with job processing time compatibility and rejection on a single machine
• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
• Parallel-machine scheduling with release dates and rejection

Cites work

• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
• A survey on offline scheduling with rejection
• Approximation algorithms in batch processing
• Bounded parallel-batch scheduling on unrelated parallel machines
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Multiprocessor Scheduling with Rejection
• Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
• Parallel-machine scheduling with deteriorating jobs and rejection
• Preemptive scheduling with rejection
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Scheduling a batching machine
• Scheduling algorithms
• Scheduling linear deteriorating jobs with rejection on a single machine
• Scheduling one batch processor subject to job release dates
• Scheduling with machine cost and rejection
• Techniques for scheduling with rejection
• The Batch Loading and Scheduling Problem
• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Cited in

(9)

• Scheduling batch processing machines with incompatible job families
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Bounded parallel-batch scheduling on unrelated parallel machines
• Batch scheduling with job processing time compatibility and rejection on a single machine
• Stochastic scheduling of a batch processing machine with incompatible job families
• scientific article; zbMATH DE number 7235424 (Why is no real title available?)
• Bag-of-tasks scheduling with rejection in large computing systems
• The unbounded parallel batch machine scheduling with rejection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489155)