The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
type: Item
instance of: scholarly article
title: The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
zbMATH Open document ID: 1339.90153
author: Dvir Shabtay
published in: European Journal of Operational Research
publication date: 2016-06-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6598033
zbMATH Keywords: batch scheduling
zbMATH Keywords: bicriteria scheduling
zbMATH Keywords: rejection
zbMATH Keywords: total completion time
MaRDI profile type: Publication
full work available at URL: j.ejor.2013.08.013
OpenAlex ID: W1971800895
cites work: The complexity of one-machine batching problems
cites work: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
cites work: Single machine batch scheduling with resource dependent setup and processing times
cites work: Batch sizing and job sequencing on a single machine
cites work: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
cites work: Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines
cites work: A single machine batch scheduling problem with bounded batch size
cites work: Minimizing flow-time on a single machine with integer batch sizes
cites work: On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
cites work: Q3525910
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Scheduling with batching: A review
cites work: Algorithms for Scheduling Independent Tasks
cites work: A survey on offline scheduling with rejection
cites work: A bicriteria approach to scheduling a single machine with job rejection and positional penalties
cites work: Single machine batch scheduling to minimize total completion time and resource consumption costs
cites work: Q3378953
cites work: Scheduling Groups of Jobs on a Single Machine
cites work: A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
DOI: 10.1016/J.EJOR.2013.08.013
Recommended article: Q3513144
Recommended article: Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
Recommended article: Single-machine batch scheduling problem with job rejection and resource dependent processing times
Recommended article: Single-machine scheduling with production and rejection costs to minimize the maximum earliness
Recommended article: Single machine scheduling with rejection to minimize the weighted makespan
Recommended article: Single machine scheduling with rejection and generalized parameters
Recommended article: Single-machine scheduling and due date assignment with rejection and position-dependent processing times
Recommended article: Q4984023
Recommended article: Single-machine scheduling under the job rejection constraint
Recommended article: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
description: scientific article; zbMATH DE number 6598033