A note on unbounded parallel-batch scheduling
From MaRDI portal
Publication:495685
DOI10.1016/J.IPL.2015.07.002zbMATH Open1337.90025OpenAlexW817947674MaRDI QIDQ495685FDOQ495685
Publication date: 15 September 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.07.002
Recommendations
- An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
- Batching machine scheduling with bicriteria: maximum cost and makespan
- Bounded parallel-batch scheduling on unrelated parallel machines
- Scheduling problems on parallel identical unbounded batch processing machines
- The unbounded parallel batch machine scheduling with rejection
parallel-batch schedulingPareto optimizationstrongly polynomial timemaximum costanalysis of algorithm
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a batching machine
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Multicriteria scheduling
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN
Cited In (10)
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
- Title not available (Why is that?)
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
- Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
- An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
- On scheduling an unbounded batch machine
- Unbounded parallel-batch scheduling with family jobs and delivery coordination
- Unbounded parallel-batch scheduling with drop-line tasks
- Hierarchical optimization on an unbounded parallel-batching machine
This page was built for publication: A note on unbounded parallel-batch scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495685)
