Single machine scheduling with two competing agents and equal job processing times

•The paper studies two agent scheduling models with unit processing times.•We provide comprehensive complexity results for many min-max and min-sum type scheduling objectives.•We provide polynomial and pseudo-polynomial time algorithms for the problems under consideration. We study various two-agent...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 244; no. 1; pp. 86 - 99
Main Authors:	Oron, Daniel, Shabtay, Dvir, Steiner, George
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.07.2015 Elsevier Sequoia S.A
Subjects:	Agency theory Algorithms Completion time Complexity Computation Equal processing times Job shops Mathematical analysis Mathematical models Mathematical problems Operational research Operations research Optimization Optimization algorithms Polynomials Production scheduling Scheduling Single machine scheduling Studies Two competing agents Equal processing times Two competing agents Single machine scheduling Complexity
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!