Results 151 to 160 of about 13,809 (278)

Stochastically minimizing makespan on a three-machine flowshop

open access: yes, 2004
Johnson considers the deterministic three-machine flowshop problem to minimize makespan. He shows that permutation schedules are dominant, and establishes an optimal algorithm for the cases where the minimum processing time on either machine 1 or machine
ALLAHVERDİ, ALİ
core  

Impact of learning effect modelling in flowshop scheduling with makespan minimisation based on the Nawaz-Enscore-Ham algorithm

open access: hybrid, 2023
Yenny A. Paredes-Astudillo   +2 more
openalex   +1 more source

Minimizing makespan on a single machine subject to random breakdowns

open access: yes, 2006
We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns.
Aytuğ, Haldun   +2 more
core  

Performance Guarantees of Local Search for Multiprocessor Scheduling

open access: yes
Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been studied ...
Vredeveld,Tjark, Schuurman,Petra
core  

Home - About - Disclaimer - Privacy