Parallel-batch scheduling with deterioration and rejection on a single machine

DOI10.1007/s11766-020-3624-2zbMath1463.90068OpenAlexW3036390668MaRDI QIDQ2194699

Dawei Li, Xi-wen Lu

Publication date: 7 September 2020

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-020-3624-2

zbMATH Keywords

NP-completedeteriorationFPTASrejectionparallel-batch scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

A survey of job shop scheduling problem: the types and models, Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times

Cites Work

• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
• A survey on offline scheduling with rejection
• Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• Scheduling linear deteriorating jobs with rejection on a single machine
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• Single machine parallel-batch scheduling with deteriorating jobs
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Single machine scheduling with release dates and rejection
• Scheduling a batching machine
• A concise survey of scheduling with time-dependent processing times
• Approximation algorithms for precedence-constrained identical machine scheduling with rejection
• Metaheuristics for a scheduling problem with rejection and tardiness penalties
• Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
• Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Multiprocessor Scheduling with Rejection
• Algorithms and Data Structures