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

DOI10.1007/S40305-014-0062-YzbMATH Open1306.90056OpenAlexW2112736884MaRDI QIDQ489155FDOQ489155

Ren-Xia Chen, Shisheng 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

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

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)

Cites Work

• Techniques for scheduling with rejection
• 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
• Scheduling one batch processor subject to job release dates
• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
• Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines
• A survey on offline scheduling with rejection
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Preemptive scheduling with rejection
• Approximation algorithms in batch processing
• Scheduling with machine cost and rejection
• Title not available (Why is that?)
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Multiprocessor Scheduling with Rejection
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Scheduling linear deteriorating jobs with rejection on a single machine
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• The Batch Loading and Scheduling Problem
• Parallel-machine scheduling with deteriorating jobs and rejection
• Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan

Cited In (4)

• Scheduling batch processing machines with incompatible job families
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Stochastic scheduling of a batch processing machine with incompatible job families
• Title not available (Why is that?)

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)