SCHEDULING TWO SALESMEN IN A NETWORK

DOI10.1142/S0129054196000257MaRDI QIDQ3126019zbMATH OpenOpenAlexFDO

Authors William F. Klostermeyer

Publication date 7 August 1997

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054196000257

zbMATH Keywords

NP-completenessSteiner treetwo-server problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Scheduling Problems with Two Competing Agents
• Two-agent scheduling in a flowshop
• A batch scheduling problem with two agents
• Scheduling in network flow shops
• Two-agent scheduling of time-dependent jobs
• scientific article; zbMATH DE number 4023002
• Dynamic scheduling to minimize lost sales subject to set-up costs
• Routing and scheduling problems with two agents on a line-shaped network
• Scheduling problems over a network of machines

This page was built for publication: SCHEDULING TWO SALESMEN IN A NETWORK

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3126019)