A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints

DOI10.1016/j.ejor.2003.03.001zbMath1065.90034OpenAlexW2017975245MaRDI QIDQ1887774

G. Cavory, Remy Dupas, Gilles Goncalves

Publication date: 22 November 2004

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

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

zbMATH Keywords

Genetic algorithmSchedulingPetri-netCyclic job shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time ⋮ Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots ⋮ A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule ⋮ Medium term production management for cyclic deliveries ⋮ Mathematical model for cyclic scheduling with work-in-process minimization ⋮ A robust basic cyclic scheduling problem ⋮ Order acceptance using genetic algorithms ⋮ Periodic schedules for linear precedence constraints ⋮ A sufficient condition for the liveness of weighted event graphs

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• The basic cyclic scheduling problem with deadlines
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• The basic cyclic scheduling problem with linear precedence constraints
• Performance evaluation of job-shop systems using timed event-graphs
• Cyclic Schedules for Job Shops with Identical Jobs
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays