Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The deployment scheduling analysis tool (DSAT)

From MaRDI portal
Publication:1767112
Jump to:navigation, search

DOI10.1016/S0895-7177(04)90561-4zbMath1055.90521OpenAlexW2069624752MaRDI QIDQ1767112

B. Melendez, T. Trainor, Kristin A. Thoney, Thom J. Hodgson

Publication date: 4 March 2005

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(04)90561-4


zbMATH Keywords

Analysis toolDeployment networkEquipment routingEquipment schedulingMilitary deployment


Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)


Related Items (4)

A graph coloring approach to the deployment scheduling and unit assignment problem ⋮ Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics ⋮ An effective lower bound on \(L_{\max}\) in a worker-constrained job shop ⋮ Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems


Uses Software

  • DSAT



Cites Work

  • Note. Satisfying Due Dates in Large Job Shops




This page was built for publication: The deployment scheduling analysis tool (DSAT)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1767112&oldid=14108763"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 07:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki