A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
From MaRDI portal
Publication:1788999
DOI10.1016/j.apm.2013.03.013zbMath1426.90120OpenAlexW2065021669MaRDI QIDQ1788999
Cheng He, Hailing Liu, Jinjiang Yuan, Qi Feng
Publication date: 9 October 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2013.03.013
Related Items (12)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost ⋮ Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study ⋮ 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 ⋮ Reduced order model predictive control for parametrized parabolic partial differential equations ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ Race to idle or not: balancing the memory sleep time with DVS for energy minimization ⋮ Bi-objective scheduling on a restricted batching machine ⋮ 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
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- Sequencing games
- Scheduling a batching machine
- On games corresponding to sequencing situations with ready times
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Competitive Two-Agent Scheduling and Its Applications
- The Batch Loading and Scheduling Problem
- Scheduling Problems with Two Competing Agents
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
This page was built for publication: A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
