Results 251 to 260 of about 13,809 (278)

Online Minimum Makespan Scheduling with a Buffer

2012
In this paper we study an online minimum makespan scheduling problem with a reordering buffer. We obtain the following results, which improve on work from FOCS 2008: i) for m identical machines, we give a 1.5-competitive online algorithm with a buffer of size 1.5m , which is better than the previous best result : 1.5-competitive algorithm with a buffer
Yan Lan, Xin Chen 0032, Ning Ding, György Dósa, Xin Han   +4 more
openaire   +1 more source

Makespan

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source

Makespan

2011
openaire   +2 more sources

Makespan Scheduling

2010
Frank Neumann, Carsten Witt
openaire   +1 more source

Stepwise Comparison for Minimizing Controller Makespan

2023 IEEE 13th International Conference on Control System, Computing and Engineering (ICCSCE), 2023
Yuki Shimizu, Takanori Hirano, Takuto Yamauchi, Kenji Tei   +3 more
openaire   +1 more source

A review and classification of heuristics for permutation flow-shop scheduling with makespan objective

Journal of the Operational Research Society, 2004
JOSÉ M Framinan, J N D Gupta
exaly  

A LISTFIT heuristic for minimizing makespan on identical parallel machines

Production Planning and Control, 2001
J N D Gupta, Alex J Ruíz-Torres
exaly  

Makespan

2013
openaire   +1 more source

A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization

Production Planning and Control, 1999
Chandrasekharan Rajendran
exaly  

On no-wait and no-idle flow shops with makespan criterion

European Journal of Operational Research, 2007
Pawel Kalczyński, Jerzy Kamburowski
exaly