A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
type: Item
instance of: scholarly article
title: A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
zbMATH Open document ID: 1403.90328
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2018-10-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6968130
zbMATH Keywords: parallel-batch
zbMATH Keywords: two agents
zbMATH Keywords: release dates
zbMATH Keywords: deterioration
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.07.040
OpenAlex ID: W2886143600
cites work: Multiagent Scheduling
cites work: Scheduling Problems with Two Competing Agents
cites work: A multiple-criterion model for machine scheduling
cites work: Scheduling a batching machine
cites work: Two-agent scheduling in a flowshop
cites work: Bounded parallel-batching scheduling with two competing agents
cites work: Q4198056
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Competitive Two-Agent Scheduling and Its Applications
cites work: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
cites work: Unbounded parallel-batching scheduling with two competitive agents
cites work: ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation
cites work: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
cites work: Minimizing makespan in batch machine scheduling
cites work: Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
cites work: Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
cites work: Complexities of some problems on multi-agent scheduling on a single machine
DOI: 10.1016/J.EJOR.2018.07.040
Recommended article: Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
Recommended article: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
Recommended article: Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
Recommended article: Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
Recommended article: A competitive two-agent scheduling problem on parallel machines with release dates and preemption
Recommended article: Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
Recommended article: Q3193570
Recommended article: Two-agent single-machine scheduling with release dates to minimize the makespan
Recommended article: A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
Recommended article: Q5197262
description: scientific article; zbMATH DE number 6968130