Scheduling a bounded parallel-batching machine with incompatible job families and rejection
type: Item
instance of: scholarly article
title: Scheduling a bounded parallel-batching machine with incompatible job families and rejection
zbMATH Open document ID: 1306.90056
author: Shisheng Li
author: Ren-Xia Chen
published in: Journal of the Operations Research Society of China
publication date: 2015-01-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6391370
zbMATH Keywords: parallel-batching scheduling
zbMATH Keywords: incompatible job families
zbMATH Keywords: rejection
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s40305-014-0062-y
OpenAlex ID: W2112736884
cites work: Multiprocessor Scheduling with Rejection
cites work: Q3425131
cites work: Scheduling a batching machine
cites work: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
cites work: Scheduling linear deteriorating jobs with rejection on a single machine
cites work: Approximation algorithms in batch processing
cites work: The Batch Loading and Scheduling Problem
cites work: Scheduling with machine cost and rejection
cites work: Techniques for scheduling with rejection
cites work: Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
cites work: Preemptive scheduling with rejection
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
cites work: Parallel-machine scheduling with deteriorating jobs and rejection
cites work: Bounded single-machine parallel-batch scheduling with release dates and rejection
cites work: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
cites work: Scheduling one batch processor subject to job release dates
cites work: Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines
cites work: The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
cites work: A survey on offline scheduling with rejection
cites work: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
DOI: 10.1007/S40305-014-0062-Y
description: scientific article; zbMATH DE number 6391370