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

Note. Satisfying Due Dates in Large Job Shops

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

DOI10.1287/mnsc.44.10.1442zbMath0989.90064OpenAlexW2036688054MaRDI QIDQ2784051

Alexander J. Weintraub, Thom J. Hodgson, Andrew Jun. Zozom, Denis Cormier

Publication date: 7 August 2002

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.44.10.1442

zbMATH Keywords

simulationjob shop schedulingmaximum lateness


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)


Related Items

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, The deployment scheduling analysis tool (DSAT), Minimizing L max for large-scale, job-shop scheduling problems



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