The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost

DOI10.1016/j.ejor.2013.08.013zbMath1339.90153OpenAlexW1971800895MaRDI QIDQ297182

Dvir Shabtay

Publication date: 24 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.013

zbMATH Keywords

bicriteria schedulingtotal completion timerejectionbatch scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling a single machine with parallel batching to minimize makespan and total rejection cost, Scheduling with release times and rejection on two parallel machines, Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types, Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities, Single-machine batch scheduling problem with job rejection and resource dependent processing times, Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection, A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling, Serial batch scheduling on uniform parallel machines to minimize total completion time, Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems, Minmax scheduling problems with common due-date and completion time penalty, Mixed batch scheduling on identical machines, Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection, Scheduling a bounded parallel-batching machine with incompatible job families and rejection, Scheduling with job-rejection and position-dependent processing times on proportionate flowshops, Minmax scheduling and due-window assignment with position-dependent processing times and job rejection, Regular scheduling measures on proportionate flowshop with job rejection, Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on offline scheduling with rejection
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• Batch sizing and job sequencing on a single machine
• Single machine batch scheduling to minimize total completion time and resource consumption costs
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
• The complexity of one-machine batching problems
• On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
• Scheduling with batching: A review
• A single machine batch scheduling problem with bounded batch size
• Minimizing flow-time on a single machine with integer batch sizes
• Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Algorithms for Scheduling Independent Tasks
• Scheduling Groups of Jobs on a Single Machine
• Single machine batch scheduling with resource dependent setup and processing times