Two-agent single machine scheduling with forbidden intervals
type: Item
instance of: scholarly article
title: Two-agent single machine scheduling with forbidden intervals
zbMATH Open document ID: 1340.90103
author: Qi Feng
author: Shisheng Li
author: Weiping Shang
published in: Applied Mathematics. Series B (English Edition)
publication date: 2016-01-15T00:00:00Z
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6532074
zbMATH Keywords: two-agent scheduling
zbMATH Keywords: dynamic programming
zbMATH Keywords: forbidden interval
MaRDI profile type: Publication
full work available at URL: s11766-015-3076-2
OpenAlex ID: W2396458309
cites work: Scheduling Problems with Two Competing Agents
cites work: Multi-agent single machine scheduling
cites work: A multiple-criterion model for machine scheduling
cites work: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
cites work: Multi-agent scheduling on a single machine with max-form criteria
cites work: Two-agent scheduling with position-based deteriorating jobs and learning effects
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Fixed interval scheduling: models, applications, computational complexity and algorithms
cites work: Current trends in deterministic scheduling
cites work: Competitive Two-Agent Scheduling and Its Applications
cites work: Unbounded parallel-batching scheduling with two competitive agents
cites work: Approximation schemes for two-machine flow shop scheduling with two agents
cites work: Scheduling with limited machine availability
cites work: Two-agent single-machine scheduling with assignable due dates
cites work: Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
cites work: An investigation on a two-agent single-machine scheduling problem with unequal release dates
cites work: A note on the scheduling with two families of jobs
cites work: Approximation schemes for two-agent scheduling on parallel machines
DOI: 10.1007/S11766-015-3076-2
description: scientific article; zbMATH DE number 6532074