Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment

DOI10.1016/S0305-0548(98)00054-9zbMath0947.90045OpenAlexW2063959439MaRDI QIDQ1302577

Richard L. Daniels, Stella Y. Hua, Webster, Scott

Publication date: 22 September 1999

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00054-9

zbMATH Keywords

heuristicsproduction schedulingflexible resource allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Scheduling with flexible resources in parallel workcenters to minimize maximum completion time ⋮ Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs ⋮ Algorithms for the unrelated parallel machine scheduling problem with a resource constraint ⋮ Minimizing the makespan on two identical parallel machines with mold constraints ⋮ Minimizing the number of late jobs for the permutation flowshop problem with secondary resources ⋮ Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources ⋮ A sequencing approach for creating new train timetables ⋮ Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem ⋮ A new model and algorithm for uncertain random parallel machine scheduling problem ⋮ Production, maintenance and resource scheduling: a review ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods

This page was built for publication: Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment