Buscar
Mostrando ítems 1-10 de 79
A genetic algorithm for scheduling on a single machine with set-up times and due dates
(Taylor & Francis LtdLondonInglaterra, 2000)
Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times
(SpringerDordrechtHolanda, 2006)
A Tabu search Approach for the Weighted Tardiness with Sequence-Dependent Setups in one-machine ProblemA Tabu search Approach for the Weighted Tardiness with Sequence-Dependent Setups in one-machine Problem
(2011-04-29)
In this paper, a Tabu Search Approach for the weighted tardiness single machine problem with sequence-dependent setups is proposed. The main contribution is the balance obtained between intensification and diversification ...
A Tabu search Approach for the Weighted Tardiness with Sequence-Dependent Setups in one-machine ProblemA Tabu search Approach for the Weighted Tardiness with Sequence-Dependent Setups in one-machine Problem
(2011-04-29)
In this paper, a Tabu Search Approach for the weighted tardiness single machine problem with sequence-dependent setups is proposed. The main contribution is the balance obtained between intensification and diversification ...
A Tabu search Approach for the Weighted Tardiness with Sequence-Dependent Setups in one-machine ProblemA Tabu search Approach for the Weighted Tardiness with Sequence-Dependent Setups in one-machine Problem
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 2002)
Decomposition methods for large job shops
(PERGAMON-ELSEVIER SCIENCE LTD, 2001)
A rolling horizon heuristic is presented for large job shops, in which the total weighted tardiness must be minimized. The method divides a given instance into a number of subproblems, each having to correspond to a time ...
Heuristic methods for the single machine scheduling problem with different ready times and a common due date
(TAYLOR & FRANCIS LTDABINGDON, 2012)
The single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness ...
A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop
(WILEY, 1999)
We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single-machine subproblems that are solved one after another. Each ...