Scheduling workers in a constricted area

DOI10.1002/(SICI)1520-6750(199602)43:1%3C143::AID-NAV9%3E3.0.CO;2-BMaRDI QIDQ5687903zbMATH OpenOpenAlexFDO

Authors Jack Brimberg, W. J. Hurley, Robert E. Wright

Publication date 16 December 1996

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199602)43:1%3C143::aid-nav9%3E3.0.co;2-b

zbMATH Keywords

2D-partition problemaircraft maintenance schedulingequi-partitioning problemmakespan

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Recommendations

• scientific article; zbMATH DE number 4029243
• Scheduling to Minimize Maximum Workload
• scientific article; zbMATH DE number 2050794
• A bin packing approach to solve the aircraft maintenance task allocation problem
• A polynomial algorithm for multiprocessor scheduling with two job lengths.

Cited in

(3)

• \(\kappa\)-partitioning problems for maximizing the minimum load
• scientific article; zbMATH DE number 2050794 (Why is no real title available?)
• Large neighborhood search for an aeronautical assembly line time-constrained scheduling problem with multiple modes and a resource leveling objective

This page was built for publication: Scheduling workers in a constricted area

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