We consider the problem of sequencing jobs on a single machine while minimizing a nondecreasing function of two criteria. We develop a heuristic procedure that quickly finds a good solution for bicriteria scheduling. The procedure is based on using several arcs in the criterion space that are repres
Optimal shift scheduling: A branch-and-price approach
β Scribed by Anuj Mehrotra; Kenneth E. Murphy; Michael A. Trick
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 127 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
β¦ Synopsis
We present a branch-and-price technique for optimal staff scheduling with multiple rest breaks, meal break, and break windows. We devise and implement specialized branching rules suitable for solving the set covering type formulation implicitly, using column generation. Our methodology is more widely applicable and computationally superior to the alternative methods in the literature. We tested our methodology on 365 test problems involving between 1728 and 86400 shift variations, and 20 demand patterns. In a direct comparison with an alternative method, our approach yields significant improvements both in cpu time and in the number of problem instances solved to optimality. The improvements were particularly marked for problems involving larger numbers of feasible shifts.
π SIMILAR VOLUMES
## Abstract In this paper we describe an approach for establishing control limits and sampling times which derives from economic performance criteria and a model for random shifts. The total cost related to both production and control is calculated, based on cost estimates for false alarms, for not
Many manufacturing and service organizations in Europe have used annualized hours, also known as flexiyear, to successfully tackle seasonal demand. Under annualized hours, the employer has a certain number of labor hours available in a year and the employer can allocate the hours over the year accor
Rather than approach the parallelization of the harmonic balance simulation method numerically, a novel scheduling-oriented approach is described. The technique leverages circuit substructure to expose potential parallelism in the form of a directed, acyclic graph (dag) of computations. This dag is