https://ira.lib.polyu.edu.hk/bitstream/10397/1269/1/SetupSurvey-2006%28June-19%29.pdf

A survey of scheduling problems with setup times or costs

http://www3.eng.cam.ac.uk/~hj231/Papers/rostering.pdf

Staff scheduling and rostering: A review of applications, methods and models

A survey on problems and methods in generalized assembly line balancing

Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art

State-of-the-art exact and heuristic solution procedures for simple assembly line balancing

The assembly line balancing problem consists of assigning tasks to an ordered sequence of stations such that the precedence relations among the tasks are satisfied and some performance measure is optimized. Due to the complexity of the problem, heuristic procedures appear to be more promising than the optimum-seeking algorithms. For the single-model, deterministic version, there are numerous exact and heuristic algorithms developed, while for the other more complex but more realistic versions, the research published consists mainly of heuristic procedures. In this paper, the heuristic procedures are critically examined and summarized in sufficient detail to provide a state-of-the-art survey. An evaluation of the procedures and some further research topics have also been presented.

/pdf/a-survey-of-the-assembly-line-balancing-procedures-1n0hz8uylu.pdf

A survey of the assembly line balancing procedures

In this paper the machine loading and tool allocation problem of an FMS is discussed, A mathematical model is developed to determine the routings of parts through the machines and to allocate appropriate cutting tools to each machine to achieve minimum overall machining cost. Computational experience with this model is presented under various system and operation parameter values. Computational refinements based on lagrangean relaxation are also discussed.

The machine loading and tool allocation problem in a flexible manufacturing system

In this paper, a methodology is developed to solve the single-model, stochastic assembly line balancing problem for the objective of minimizing the total labor cost and the expected incompletion cost arising from tasks not completed within the prescribed cycle time. The methodology is based on determining an initial DP based solution and its improvement using a branch-and-bound procedure which uses an approximate solution instead of a lower bound for fathoming nodes. Detailed experimentation shows the superiority of this method over the most promising one from the literature.

/pdf/a-methodology-for-solving-single-model-stochastic-assembly-1c45m8ag4m.pdf

A methodology for solving single-model, stochastic assembly line balancing problem

Production scheduling in semiconductor wafer fabs is a non-trivial task owing to the complexity of wafer fabrication. Dispatching rules are the most commonly used tools for shop floor control in this industry. Over the years, advanced dispatching rules, capable of impacting multiple performance measures and utilising both upstream and downstream information in assigning lot priorities, have been introduced. This article aims to provide an overview of these rules and explores the effectiveness of their performance as they pertain to different areas in a wafer fab. Based on this overview, several future directions on developing new dispatching rules are also proposed.

Subhash C. Sarin

Papers

A survey of the assembly line balancing procedures

The machine loading and tool allocation problem in a flexible manufacturing system

A methodology for solving single-model, stochastic assembly line balancing problem

A survey of dispatching rules for operational control in wafer fabrication

New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints