Personnel scheduling: A literature review

In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting from describing the manufacturing process, we identify typical scheduling problems found in semiconductor manufacturing systems. We describe batch scheduling problems, parallel machine scheduling problems, job shop scheduling problems, scheduling problems with auxiliary resources, multiple orders per job scheduling problems, and scheduling problems related to cluster tools. We also present important solution techniques that are used to solve these scheduling problems by means of specific examples, and report on known implementations. Finally, we summarize some of the challenges in scheduling semiconductor manufacturing operations.

A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations

This paper presents a review and classification of the literature regarding workforce planning problems incorporating skills. In many cases, technical research regarding workforce planning focuses very hard on the mathematical model and neglects the real life implications of the simplifications that were needed for the model to perform well. On the other hand, many managerial studies give an extensive description of the human implications of certain management decisions in particular cases, but fail to provide useful mathematical models to solve workforce planning problems. This review will guide the operations researcher in his search to find useful papers and information regarding workforce planning problems incorporating skills. We not only discuss the differences and similarities between different papers, but we also give an overview of the managerial insights. The objective is to present a combination of technical and managerial knowledge to encourage the production of more realistic and useful solution techniques.

/pdf/workforce-planning-incorporating-skills-state-of-the-art-2qgte9yu0o.pdf

Workforce Planning Incorporating Skills: State of the Art

Workforce planning incorporating skills: State of the art

The Unit Commitment problem in energy management aims at finding the optimal production schedule of a set of generation units, while meeting various system-wide constraints. It has always been a large-scale, non-convex, difficult problem, especially in view of the fact that, due to operational requirements, it has to be solved in an unreasonably small time for its size. Recently, growing renewable energy shares have strongly increased the level of uncertainty in the system, making the (ideal) Unit Commitment model a large-scale, non-convex and uncertain (stochastic, robust, chance-constrained) program. We provide a survey of the literature on methods for the Uncertain Unit Commitment problem, in all its variants. We start with a review of the main contributions on solution methods for the deterministic versions of the problem, focussing on those based on mathematical programming techniques that are more relevant for the uncertain versions of the problem. We then present and categorize the approaches to the latter, while providing entry points to the relevant literature on optimization under uncertainty. This is an updated version of the paper “Large-scale Unit Commitment under uncertainty: a literature survey” that appeared in 4OR 13(2):115–171 (2015); this version has over 170 more citations, most of which appeared in the last 3 years, proving how fast the literature on uncertain Unit Commitment evolves, and therefore the interest in this subject.

/pdf/large-scale-unit-commitment-under-uncertainty-an-updated-1y9g07xljm.pdf

Large-scale unit commitment under uncertainty: an updated literature survey

Cut generation for an employee timetabling problem

Heuristics for the multi-item capacitated lot-sizing problem with lost sales

This paper deals with a parallel machine scheduling problem whose objective is to minimize a regular step total cost function A real world application of the problem is presented, and Mixed Integer Linear Programming models are described for the cases with and without release dates, as well as a dedicated constraint generation procedure Experimental results are reported and discussed to evaluate the relevance of the different approaches on well-known special cases and the general case

Scheduling jobs on parallel machines to minimize a regular step total cost function

https://hal.archives-ouvertes.fr/hal-01836057/document

Boris Detienne

Papers

Cut generation for an employee timetabling problem

Heuristics for the multi-item capacitated lot-sizing problem with lost sales

Scheduling jobs on parallel machines to minimize a regular step total cost function

Optimizing power generation in the presence of micro-grids

A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints