Bounded parallel-batching scheduling with two competing agents

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Journal of Scheduling

• Publication date

  2012-04-25

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/s10951-012-0274-0
• 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
• Two-agent scheduling to minimize the total cost

  2011cited by this paper
• Single machine batch scheduling with two competing agents to minimize total flowtime

  2011cited by this paper
• Two-agent single-machine scheduling with position-dependent processing times

  2010cited by this paper
• On the complexity of bi-criteria scheduling on a single batch processing machine

  2010cited by this paper
• Scheduling two agents with controllable processing times

  2010cited by this paper
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures

  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
• Complexity results for parallel machine scheduling problems with a server in computer systems

  2008cited 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 note on the complexity of the problem of two-agent scheduling on a single machine

  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

  2004influential reference
• A Multiple-Criterion Model for Machine Scheduling

  2003cited by this paper
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

  2000influential reference
• Scheduling with batching: A review

  2000cited by this paper
• Batching identical jobs

  2000cited by this paper
• Minimizing makespan on a single batch processing machine with dynamic job arrivals

  1999cited by this paper
• Scheduling a batching machine

  1998cited by this paper
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

  1997cited by this paper
• Scheduling Algorithms

  1995cited by this paper
• Minimizing total completion time on a batch processing machine with job families

  1993cited by this paper
• Minimizing total completion time on batch processing machines

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

  1992cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982influential reference
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

  1975cited by this paper

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

  2026cites this paper
• Coordinating two agents in parallel-batching scheduling to minimize the number of late jobs

  2026cites this paper
• Fifty years of research in scheduling - Theory and applications

  2025cites this paper
• Parallel-batching scheduling with two agents, release dates and equal processing times

  2025cites this paper
• Two-agent scheduling in a two-machine open shop

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

  2022cites this paper
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs

  2021cites this paper
• A survey of scheduling with parallel batch (p-batch) processing

  2021cites this paper
• A Heuristic Solution Approach to Order Batching and Sequencing for Manual Picking and Packing Lines considering Fatiguing Effect

  2021cites this paper
• The Competing Job Sets Scheduling Problems With Two Types of Release Dates on Batching-Machine

  2020cites this paper
• Multitasking scheduling problems with two competitive agents

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

  2019cites this paper
• A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan

  2019cites this paper
• Two-agent scheduling on a single machine with release dates

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

  2018cites this paper
• Two‐agent scheduling on a single sequential and compatible batching machine

  2017cites this paper
• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine

  2017cites this paper
• Pareto optimization for the two-agent scheduling problems with linear non-increasing deterioration based on Internet of Things

  2017cites this paper
• An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines

  2017cites this paper
• Proportionate Flow Shop Scheduling with Multi-agents to Maximize Total Gains of JIT Jobs

  2017cites this paper
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

  2017cites this paper
• Exploring the Cooperative Game Nature of a Two-agent Scheduling Problem

  2016cites this paper
• Minimizing maximum cost on a single machine with two competing agents and job rejection

  2016cites this paper
• Two game-based solution concepts for a two-agent scheduling problem

  2016cites this paper
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost

  2016cites this paper
• Neighborhood search with memory and global exchange for three-agent job shop scheduling

  2016cites this paper
• A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines

  2016cites this paper
• Two-phase neighborhood search algorithm for two-agent hybrid flow shop scheduling problem

  2015cites this paper
• Scheduling two job families on a single machine with two competitive agents

  2015cites this paper
• Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions

  2014cites this paper
• A Parallel Iterated Local Search for Two-Agent Flow Shop Scheduling

  2014cites this paper
• Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan

  2014cites this paper
• A GENETIC ALGORITHM WITH MODIFIED CROSSOVER OPERATOR FOR A TWO-AGENT SCHEDULING PROBLEM

  2013cites this paper