Buscar
Mostrando ítems 1-10 de 126
Tabu search for total tardiness minimization in flowshop scheduling problems
(Pergamon-elsevier Science LtdOxfordInglaterra, 1999)
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
(PERGAMON-ELSEVIER SCIENCE LTD, 2009)
The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for ...
Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
(SPRINGER, 2010)
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have ...
Tardiness minimization in a flexible job shop: A tabu search approach
(Kluwer Academic PublDordrechtHolanda, 2004)
Lower bounding schemes for flowshops with blocking in-process
(Palgrave Publishers LtdBasingstokeInglaterra, 2001)
Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times
(SpringerDordrechtHolanda, 2006)
Tabu search for scheduling on identical parallel machines to minimize mean tardiness
(Kluwer Academic PublDordrechtHolanda, 2000)
ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total Tardiness
(Journal of Applied Mathematics, 2018)
A partial enumeration heuristic for multi-objective flowshop scheduling problems
(Palgrave Publishers LtdBasingstokeInglaterra, 2004)
A genetic algorithm for scheduling on a single machine with set-up times and due dates
(Taylor & Francis LtdLondonInglaterra, 2000)