A hybrid approach to scheduling with earliness and tardiness costs

DOI10.1023/A:1021849405707zbMath1026.90039OpenAlexW1535845781MaRDI QIDQ1861936

Philippe Refalo, J. Christopher Beck

Publication date: 10 March 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021849405707

zbMATH Keywords

linear programmingschedulingmixed integer programminghybrid algorithmsconstraints

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Temporal linear relaxation in IBM ILOG CP optimizer ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ Multirunway optimization schedule of airport based on improved genetic algorithm by dynamical time window ⋮ A case study of mutual routing-scheduling reformulation ⋮ A global constraint for total weighted completion time for unary resources ⋮ Multi-coloring and job-scheduling with assignment and incompatibility costs ⋮ A job-shop scheduling approach for optimising sugarcane rail operations ⋮ Lagrangian bounds for just-in-time job-shop scheduling ⋮ The job shop scheduling problem with convex costs ⋮ A meta-heuristic to solve the just-in-time job-shop scheduling problem

This page was built for publication: A hybrid approach to scheduling with earliness and tardiness costs