CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date a...

Full description

Bibliographic Details

Published in:	Naval research logistics Vol. 63; no. 5; pp. 416 - 429
Main Authors:	Yin, Yunqiang, Wang, Du-Juan, Wu, Chin-Chia, Cheng, T.C.E.
Format:	Journal Article
Language:	English
Published:	New York Blackwell Publishing Ltd 01.08.2016 Wiley Subscription Services, Inc
Subjects:	Algorithms Completion time Criteria due date assignment Due dates Logistics Mathematical analysis Navy Scheduling two agents
ISSN:	0894-069X, 1520-6750
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!