Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics

DOI10.1016/j.cor.2013.02.008zbMath1348.90289OpenAlexW2161878318WikidataQ57425625 ScholiaQ57425625MaRDI QIDQ336577

Thom J. Hodgson, Kristin A. Thoney, Benjamin J. Lobo, Russell E. King, James R. Wilson

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.008

zbMATH Keywords

job shop schedulingmaximum latenessdual resource constrained systemsworker allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Theory of organizations, manpower planning in operations research (90B70)

Related Items (1)

An effective lower bound on \(L_{\max}\) in a worker-constrained job shop

Uses Software

• DSAT

Cites Work

• An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
• Modeling simultaneous worker learning and forgetting in dual resource constrained systems
• Benchmarks for shop scheduling problems
• The deployment scheduling analysis tool (DSAT)
• Note. Satisfying Due Dates in Large Job Shops
• Examination of flexibility acquisition policies in dual resource constrained job shops with simultaneous worker learning and forgetting effects
• On optimal and data-based histograms
• Scheduling research in multiple resource constrained job shops: a review and critique
• Minimizing L _max for large-scale, job-shop scheduling problems

This page was built for publication: Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics