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

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

zbMATH Keywords

approximation algorithmfamilybatchingparallel machineworst case ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (13)

• Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• 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
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
• Parallel batch scheduling of equal-length jobs with release and due dates
• Unbounded parallel-batching scheduling with two competitive agents
• Unbounded parallel-batch scheduling with family jobs and delivery coordination
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection
• Online scheduling on unbounded parallel-batch machines with incompatible job families
• Minimizing makespan with release times on identical parallel batching machines
• Exact algorithms for scheduling multiple families of jobs on parallel machines
• Single-machine batch scheduling with job processing time compatibility

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)