Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint

By Imed Kacem, Chengbin Chu. 2008

55 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/83294c7613b66514d7982269f0448d97421f759d

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

In Industrial and Manufacturing Engineering

1. Chengbin Chu

Citations in the corpus

• An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance (2016, background): “…trading as Taylor & Francis Group The job scheduling problem with a single unavailable period constraint, as a special case of periodic maintenance, can be found in recent literature, such as Wang, Sun, and Chu (2005), Kacem, Chu, and Souissi (2008), Kacem and Chu (2008) and Mellouli et al. (2008).”