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...

Celý popis

Podrobná bibliografie

Vydáno v:	Naval research logistics Ročník 63; číslo 5; s. 416 - 429
Hlavní autoři:	Yin, Yunqiang, Wang, Du-Juan, Wu, Chin-Chia, Cheng, T.C.E.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Blackwell Publishing Ltd 01.08.2016 Wiley Subscription Services, Inc
Témata:	Algorithms Completion time Criteria due date assignment Due dates Logistics Mathematical analysis Navy Scheduling two agents
ISSN:	0894-069X, 1520-6750
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!