Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness

@inproceedings{NaderiSchedulingHF,
  title={Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness},
  author={B. Naderi and Mostafa Zandieh and V. Roshanaei}
}
This article addresses the problem of scheduling hybrid flowshops where the setup times are sequence dependent to minimize makespan and maximum tardiness. To solve such an NP-hard problem, we introduce a novel simulated annealing (SA) with a new concept, called “Migration mechanism”, and a new operator, called “Giant leap”, to bolster the competitive performance of SA through striking a compromise between the lengths of neighborhood search structures. We hybridize the SA (HSA) with a simple… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

Similar Papers

Loading similar papers…