A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem

DOI10.1016/j.ejor.2007.06.039zbMath1146.90427OpenAlexW2068142293MaRDI QIDQ2427185

Jean-Charles Billaut, Geoffrey Vilcot

Publication date: 8 May 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.039

zbMATH Keywords

schedulingtabu searchgenetic algorithmbicriteriageneral job shop

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem ⋮ Solving the flexible job shop scheduling problem with sequence-dependent setup times ⋮ Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times ⋮ A MILP model for an extended version of the flexible job shop problem ⋮ A worker constrained flexible job shop scheduling problem with sequence-dependent setup times ⋮ Modelling and solving resource allocation problems via a dynamic programming approach ⋮ Developing equilibrium optimization methods for hub location problems ⋮ A new hybrid genetic algorithm for job shop scheduling problem ⋮ Novel multi-objective resource allocation and activity scheduling for fourth party logistics ⋮ Mathematical models for job-shop scheduling problems with routing and process plan flexibility ⋮ Metaheuristics for the online printing shop scheduling problem ⋮ A bi-objective turning restriction design problem in urban road networks ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs

Cites Work

• Unnamed Item
• An effective architecture for learning and evolving flexible job-shop schedules
• Benchmarks for shop scheduling problems
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• A hierarchical approach for the FMS scheduling problem
• A heuristic to schedule flexible job-shop in a glass factory
• Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
• Effective neighbourhood functions for the flexible job shop problem
• Routing and scheduling in a flexible job shop by tabu search
• Multicriteria scheduling problems: a survey
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Tabu Search—Part I