Optimal methods for batch processing problem with makespan and maximum lateness objectives
From MaRDI portal
Publication:967805
DOI10.1016/J.APM.2009.04.007zbMath1185.90092OpenAlexW2084103258MaRDI QIDQ967805
Fariborz Jolai, M. T. Yazdani Sabouni
Publication date: 2 May 2010
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2009.04.007
dynamic programmingmakespanbatch processing machinemulti-agent modelmaximum latenessbi-criteria scheduling
Related Items (12)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives ⋮ A constraint programming approach for a batch processing problem with non-identical job sizes ⋮ Two-agent scheduling with agent specific batches on an unbounded serial batching machine ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Bi-objective scheduling on a restricted batching machine ⋮ A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives ⋮ Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines ⋮ Unbounded parallel-batch scheduling with drop-line tasks ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
Cites Work
This page was built for publication: Optimal methods for batch processing problem with makespan and maximum lateness objectives
