Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
type: Item
instance of: scholarly article
title: Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
zbMATH Open document ID: 1394.90310
author: Jun-Qiang Wang
author: Guo-Qiang Fan
author: Cheng-Wu Zhang
author: Joseph Y.-T. Leung
author: Yingqian Zhang
published in: European Journal of Operational Research
publication date: 2018-05-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6873519
zbMATH Keywords: scheduling
zbMATH Keywords: heuristics
zbMATH Keywords: parallel-batching machine
zbMATH Keywords: two-agent scheduling
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.10.024
OpenAlex ID: W2539408631
cites work: Multiagent Scheduling
cites work: Scheduling Problems with Two Competing Agents
cites work: A Lagrangian approach to single-machine scheduling problems with two competing agents
cites work: A multiple-criterion model for machine scheduling
cites work: Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
cites work: Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
cites work: Bounded parallel-batching scheduling with two competing agents
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3002852
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Competitive Two-Agent Scheduling and Its Applications
cites work: Minimizing makespan on a single batching machine with release times and non-identical job sizes
cites work: Unbounded parallel-batching scheduling with two competitive agents
cites work: Scheduling one batch processor subject to job release dates
cites work: Single machine batch scheduling with two competing agents to minimize total flowtime
cites work: A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
cites work: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
cites work: Scheduling with batching: A review
cites work: Q3234482
cites work: Scheduling aircraft landings using airlines' preferences
cites work: Minimizing makespan on a single burn-in oven in semiconductor manufacturing
cites work: Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
cites work: Scheduling a single batch processing machine with non-identical job sizes
cites work: Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
cites work: Makespan minimization on single batch-processing machine via ant colony optimization
cites work: Minimizing makespan on a single batch processing machine with nonidentical job sizes
cites work: Approximation schemes for two-agent scheduling on parallel machines
DOI: 10.1016/J.EJOR.2016.10.024
description: scientific article; zbMATH DE number 6873519