Showing 1 - 10 of 176,128
scheduling n jobs on m identical parallel machines is solved such that the expected makespan is minimised. The machines are …, three construction heuristics and an Ant Colony System (ACS) algorithm are developed for solving this integrated problem …
Persistent link: https://www.econbiz.de/10011305782
Persistent link: https://www.econbiz.de/10013453987
Persistent link: https://www.econbiz.de/10014567009
model considering task release time is established, and a branch-and-bound algorithm with multiple effective dominance rules … carried out with a randomly generated case base, and the computational experimental results show that the algorithm can give …
Persistent link: https://www.econbiz.de/10014082437
Persistent link: https://www.econbiz.de/10012421529
Persistent link: https://www.econbiz.de/10012299981
a constraint-free mathematical presentation for this problem. We explore performance measures of makespan and total … lower bounds as well as nine efficient heuristics for solving the problem with the objective of minimizing makespan. The …
Persistent link: https://www.econbiz.de/10012029504
The Apparent Tardiness Cost (ATC) dispatching rule was initially developed to minimize tardiness in single-machine scheduling problems. ATC extensions have been frequently applied in other production settings, relying heavily on blocking idle machine capacity with a single-machine outlook; this...
Persistent link: https://www.econbiz.de/10014543471
to use Johnson’s algorithm (1954) as their core. This paper presents a state space (SS) heuristic, integrated with a …
Persistent link: https://www.econbiz.de/10014036083
Persistent link: https://www.econbiz.de/10010485486