This paper is concerned with the problem of determining the optimal size and composition of a permanent workforce needed to run a facility when demand is specified by a workstation group (WSG) for up to 24 hours a day, 7 days a week. For full-time employees, a solution is characterized by a bid...

For a given planning horizon, workforce composition and set of labor requirements, personnel scheduling often reduces to solving three problems. The first is concerned with the assignment of days off; the second involves assigning workers to shifts during the day; and the third involves the...

This paper presents an algorithm for efficiently sequencing the cutting operations associated with the manufacture of discrete parts on a CNC machine. The problem is first modeled as an integer program but recast via Lagrangian relaxation as a min-cut problem on a bipartite network. Tight lower...