A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Applied Mathematical Modelling

• Publication date

  2013-06-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/J.APM.2013.03.013
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Unbounded parallel-batching scheduling with two competitive agents

  2011cited by this paper
• Optimal methods for batch processing problem with makespan and maximum lateness objectives

  2010cited by this paper
• Competitive Two-Agent Scheduling and Its Applications

  2010cited by this paper
• Multi-agent scheduling on a single machine with max-form criteria

  2008cited by this paper
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan

  2007cited by this paper
• Multi-agent single machine scheduling

  2007cited by this paper
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs

  2006cited by this paper
• A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor

  2006cited by this paper
• Scheduling Problems with Two Competing Agents

  2004cited by this paper
• A Multiple-Criterion Model for Machine Scheduling

  2003cited by this paper
• The Batch Loading and Scheduling Problem

  2001cited by this paper
• Compensatory negotiation for agent-based project schedule coordination

  2000cited by this paper
• Scheduling a batching machine

  1998cited by this paper
• Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function

  1995cited by this paper
• On games corresponding to sequencing situations with ready times

  1995cited by this paper
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

  1992cited by this paper

• Pareto optimization of two-agent scheduling on parallel batch machines

  2026cites this paper
• Serial- and hierarchical-batch scheduling: a systematic review and future research directions

  2024cites this paper
• An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan

  2023cites this paper
• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan

  2022cites this paper
• Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost

  2021cites this paper
• Two-agent scheduling on mixed batch machines to minimise the total weighted makespan

  2020cites this paper
• Two-Agent Scheduling on a Bounded Parallel-Batching Machine with Makespan and Maximum Lateness Objectives

  2019cites this paper
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent

  2019cites this paper
• An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines

  2018cites this paper
• Bi-objective scheduling on a restricted batching machine

  2018cites this paper
• Two-agent scheduling on a single parallel-batching machine to minimize the weighted sum of the agents’ makespans

  2018cites this paper
• Unbounded parallel-batch scheduling with drop-line tasks

  2018cites this paper
• A modified imperialist competitive algorithm for a two-agent single-machine scheduling under periodic maintenance consideration

  2018cites this paper
• Algorithms for two-agent scheduling with earliness cost

  2018cites this paper
• Modelling and scheduling multi-objective flow shop problems with interfering jobs

  2017cites this paper
• Genetic Algorithm Based Novel Methodology of Multi-Constraint Job Scheduling

  2017cites this paper
• Solving a bi-objective unrelated parallel batch processing machines scheduling problem: A comparison study

  2017cites this paper
• New Formulation and Solution in PCB Assembly Systems with Parallel Batch processors

  2017cites this paper
• A parallel machine scheduling problem with two-agent and tool change activities: an efficient hybrid metaheuristic algorithm

  2016cites this paper
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work

  2016cites this paper
• Race to idle or not: balancing the memory sleep time with DVS for energy minimization

  2015cites this paper
• Two-agent single machine scheduling with forbidden intervals

  2015cites this paper
• Heuristics for Non-dominated Sets of Two-Agent Scheduling on a Single Parallel-Batching Machine

  2015cites this paper
• Batching Scheduling Problems

  2014cites this paper
• Scheduling Problems with Variable Job Processing Times

  2014cites this paper
• Problems, Algorithms and Complexity

  2014cites this paper
• Single Machine Problems

  2014cites this paper
• Some new problems on two-agent scheduling to minimize the earliness costs

  2014cites this paper
• Multiagent Scheduling Fundamentals

  2014cites this paper
• Parallel Machine Scheduling Problems

  2014cites this paper
• Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times

  2013cites this paper