Scheduling with limited machine availability

By Günter Schmidt. European Journal of Operational Research, 2000

508 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/fdf18a60457ad864faecf6f1c0ad0f33af52800e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Chengbin Chu
2. Imed Kacem
3. Meral Azizoglu
4. Sakine Batun

In Industrial and Manufacturing Engineering

1. Chengbin Chu
2. Imed Kacem
3. Meral Azizoglu
4. Sakine Batun
5. Liang Gao
6. Guohui Zhang
7. Yang Shi

Citations in the corpus

• Single machine scheduling with preventive maintenances (2009, methodology): “We use the three-field, j j , representation scheme introduced by Graham et al. (1979) and adapted to the problems having availability constraints by Sanlaville and Schmidt (1998) and Schmidt (2000).”
• Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint (2008, background): “For more details and more references concerning this research topic, please refer to the recent stateof-the-art papers (Sanlaville and Schmidt, 1998; Schmidt, 2000; Lee, 2004).”