Single workgroup scheduling problem with variable processing personnel

DOI10.1007/S10100-019-00655-8MaRDI QIDQ2173005zbMATH OpenOpenAlexWikidataFDO

Authors 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 algorithmheuristic strategyhuman resources variabilitypersonnel schedulingtwo-dimensional strip packing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Research on flexible personnel scheduling for single task with delivery date as the goal
• Single-machine group scheduling problems with variable job processing times
• A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry
• Variable employee productivity in workforce scheduling
• A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times

Cites work

• A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A note on minimizing the sum of squares of machine completion times on two identical parallel machines
• A recursive heuristic algorithm for 2D rectangular strip packing problems
• A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
• A single machine scheduling problem with two-dimensional vector packing constraints
• An exact approach to the strip-packing problem
• 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
• Exact algorithms for the guillotine strip cutting/packing problem.
• Exhaustive approaches to 2D rectangular perfect packings
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• LP models for bin packing and cutting stock problems
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
• Tight upper bounds for semi-online scheduling on two uniform machines with known optimum

Cited in

(2)

• Human factors in a contemporary organization
• Multicommodity network flow model of a human resource allocation problem considering time periods

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

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