An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization
- 28 June 2012
- journal article
- research article
- Published by Springer Science and Business Media LLC in Soft Computing
- Vol. 16 (12), 2097-2113
- https://doi.org/10.1007/s00500-012-0880-y
Abstract
No abstract availableThis publication has 40 references indexed in Scilit:
- Combining Constraint Programming and Local Search for Job-Shop SchedulingINFORMS Journal on Computing, 2011
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup timesComputers & Mathematics with Applications, 2011
- Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid metaheuristics and weighted min–max techniqueSoft Computing, 2010
- A single machine scheduling problem with availability constraints and sequence-dependent setup costsApplied Mathematical Modelling, 2010
- Job shop scheduling with setup times, deadlines and precedence constraintsJournal of Scheduling, 2008
- Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational AnalysisAnnals of Operations Research, 2005
- A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup TimesLecture Notes in Computer Science, 2004
- Guided Local Search with Shifting Bottleneck for Job Shop SchedulingManagement Science, 1998
- A generalized permutation approach to job shop scheduling with genetic algorithmsOR Spectrum, 1995
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991