Scheduling a single machine with parallel batching to minimize makespan and total rejection cost

DOI10.1016/j.dam.2015.10.021zbMath1339.90138OpenAlexW2193919580MaRDI QIDQ266826

Cheng He, Joseph Y.-T. Leung, Kangbok Lee, Michael L. Pinedo

Publication date: 7 April 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.10.021

zbMATH Keywords

dynamic programmingmakespanapproximation algorithmsFPTASrejectionbatching machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Approximation algorithms (68W25)

Related Items (9)

Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system ⋮ Two-agent parallel-machine scheduling with rejection ⋮ Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Parallel-batch scheduling with deterioration and rejection on a single machine ⋮ Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection ⋮ A new model and algorithm for uncertain random parallel machine scheduling problem ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
• A survey on offline scheduling with rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Single-machine scheduling under the job rejection constraint
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
• Single machine scheduling with release dates and rejection
• Scheduling a batching machine
• Scheduling one batch processor subject to job release dates
• On scheduling an unbounded batch machine
• Scheduling with batching: A review
• Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing makespan on a single batch processing machine with dynamic job arrivals

This page was built for publication: Scheduling a single machine with parallel batching to minimize makespan and total rejection cost