Now showing items 1-3 of 3

    • Maximizing the minimum completion time on parallel machines 

      Haouari, M.; Jemmali, M. (Springer, 2008)
      We propose an exact branch-and-bound algorithm for the problem of maximizing the minimum machine completion time on identical parallel machines. The proposed algorithm is based on tight lower and upper bounds as well as ...
    • Minimizing schedule length on identical parallel machines: an exact algorithm 

      Akyel, H. Cemal (Bilkent University, 1991)
      The primary concern of this study is to investigate the combinatorial aspects of the single-stage identical parallel machine scheduling problem and to develop a computationally feasible branch and bound algorithm for its ...
    • Tight bounds for the identical parallel machine-schedulingproblem: part II 

      Haouari, M.; Jemmali, M. (Wiley-Blackwell Publishing, 2008)
      A companion paper introduces new lower bounds and heuristics for the problem of minimizing makespan onidentical parallel machines. The objective of this paper is threefold. First, we describe further enhancementsof previously ...