A note on unbounded parallel-batch scheduling

DOI10.1016/J.IPL.2015.07.002MaRDI QIDQ495685zbMATH OpenOpenAlexFDO

Authors Zhichao Geng, Jinjiang Yuan

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

zbMATH Keywords

parallel-batch schedulingPareto optimizationstrongly polynomial timemaximum costanalysis of algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• Batching machine scheduling with bicriteria: maximum cost and makespan
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Multicriteria scheduling
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling a batching machine

Cited in

(10)

• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
• scientific article; zbMATH DE number 6501083 (Why is no real title available?)
• Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
• 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
• Min-max scheduling of batch or drop-line jobs under agreeable release and processing times
• 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)