A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
type: Item
instance of: scholarly article
title: A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
zbMATH Open document ID: 1377.90033
author: Baruch Mor
author: Gur Mosheiov
published in: Journal of Combinatorial Optimization
publication date: 2017-08-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 6756033
zbMATH Keywords: scheduling
zbMATH Keywords: single machine
zbMATH Keywords: two agents
zbMATH Keywords: common flow-allowance
zbMATH Keywords: minmax
MaRDI profile type: Publication
full work available at URL: s10878-016-0049-1
OpenAlex ID: W2469632011
cites work: Single Machine Scheduling with Flow Allowances
cites work: Scheduling Problems with Two Competing Agents
cites work: Multi-agent single machine scheduling
cites work: Multiagent Scheduling
cites work: A multiple-criterion model for machine scheduling
cites work: Scheduling problems with two competing agents to minimized weighted earliness-tardiness
cites work: Single machine just‐in‐time scheduling problems with two competing agents
cites work: A survey of the state-of-the-art of common due date assignment and scheduling research
cites work: Competitive Two-Agent Scheduling and Its Applications
cites work: Solving a two-agent single-machine scheduling problem considering learning effect
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 problems with two competing agents to minimize minmax and minsum earliness measures
cites work: Single machine batch scheduling with two competing agents to minimize total flowtime
cites work: Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
cites work: Minmax scheduling with job-classes and earliness-tardiness costs
cites work: Q3071146
cites work: Due-date assignment on uniform machines
cites work: A note on the complexity of the problem of two-agent scheduling on a single machine
cites work: Single machine common flow allowance scheduling with controllable processing times
cites work: Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
DOI: 10.1007/S10878-016-0049-1
Recommended article: Q3462919
Recommended article: Two-agent single-machine scheduling with assignable due dates
Recommended article: A survey of due-date related single-machine with two-agent scheduling problem
Recommended article: Two-agent scheduling in a flowshop
Recommended article: Single machine batch scheduling with two competing agents to minimize total flowtime
Recommended article: Two-agent single-machine scheduling problem with just-in-time jobs
Recommended article: Two‐agent scheduling on a single sequential and compatible batching machine
Recommended article: Q3381063
Recommended article: A single-machine bi-criterion scheduling problem with two agents
Recommended article: Approximation schemes for two-machine flow shop scheduling with two agents
description: scientific article; zbMATH DE number 6756033