Solving scheduling problems from high-level models

DOI10.1007/S10288-010-0143-7zbMath1230.90096OpenAlexW1979928555MaRDI QIDQ657573

Jean-Noël Monette

Publication date: 10 January 2012

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-010-0143-7

zbMATH Keywords

modelingschedulingjust-in-timeconstraint programmingjob-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Uses Software

• COMET

Cites Work

• Resource-constrained project scheduling: A critical activity reordering heuristic
• A very fast TS/SA algorithm for the job shop scheduling problem
• Lagrangian bounds for just-in-time job-shop scheduling
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• A fast tabu search algorithm for the group shop scheduling problem
• Parallel Local Search in Comet
• A Position-Based Propagator for the Open-Shop Problem

This page was built for publication: Solving scheduling problems from high-level models