Single workgroup scheduling problem with variable processing personnel

DOI10.1007/s10100-019-00655-8OpenAlexW2981241271WikidataQ127019378 ScholiaQ127019378MaRDI QIDQ2173005

Bentao Su, Nai-ming Xie

Publication date: 22 April 2020

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-019-00655-8

zbMATH Keywords

genetic algorithmpersonnel schedulingtwo-dimensional strip packing problemheuristic strategyhuman resources variability

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Human factors in a contemporary organization

Cites Work

• Unnamed Item
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
• A single machine scheduling problem with two-dimensional vector packing constraints
• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
• Exact algorithms for the guillotine strip cutting/packing problem.
• Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
• Bounds for parallel machine scheduling with predefined parts of jobs and setup time
• Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
• A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
• LP models for bin packing and cutting stock problems
• A note on minimizing the sum of squares of machine completion times on two identical parallel machines
• Exhaustive approaches to 2D rectangular perfect packings
• An Exact Approach to the Strip-Packing Problem
• Recursive Heuristic Algorithm for the 2D Rectangular Strip Packing Problem
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

This page was built for publication: Single workgroup scheduling problem with variable processing personnel