Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan

DOI10.1007/S10878-008-9163-ZzbMATH Open1183.90179OpenAlexW2014763284MaRDI QIDQ2268765FDOQ2268765

Authors Jinjiang Yuan, Shisheng Li 

Publication date 9 March 2010

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-008-9163-z

zbMATH Keywords

approximation algorithmfamilybatchingparallel machineworst case ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Parallel machine scheduling by family batching with sequence-independent set-up times
• Scheduling jobs with release dates on parallel batch processing machines
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
• Scheduling job families on non-identical parallel machines with time constraints
• Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
• Exact algorithms for scheduling multiple families of jobs on parallel machines

Cites work

• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• Approximation algorithms in batch processing
• Bounds on Multiprocessing Timing Anomalies
• Complexity results for single-machine problems with positive finish-start time-lags
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Minimizing makespan with release times on identical parallel batching machines
• On scheduling an unbounded batch machine
• Scheduling a batching machine
• Scheduling one batch processor subject to job release dates
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Cited in

(15)

• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
• Parallel batch scheduling with nested processing set restrictions
• Single-machine batch scheduling with job processing time compatibility
• Exact algorithms for scheduling multiple families of jobs on parallel machines
• Unbounded parallel-batch scheduling with family jobs and delivery coordination
• Minimizing makespan with release times on identical parallel batching machines
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection
• Unbounded parallel-batching scheduling with two competitive agents
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
• Min-max scheduling of batch or drop-line jobs under agreeable release and processing times
• The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
• Parallel batch scheduling of equal-length jobs with release and due dates
• Online scheduling on unbounded parallel-batch machines with incompatible job families
• Scheduling jobs with release dates on parallel batch processing machines

This page was built for publication: Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268765)